Palpate
发表于 2025-3-23 11:59:48
Lyndon Benke,Michael Papasimeon,Tim MillerIn this chapter, we study polycyclic, negacyclic, constacyclic, quasicyclic and skew cyclic codes which are all generalizations of the important family of cyclic codes. We describe their algebraic setting and show how to use this setting to classify these families of codes.
宏伟
发表于 2025-3-23 17:44:16
http://reply.papertrans.cn/16/1526/152559/152559_12.png
不整齐
发表于 2025-3-23 19:19:16
http://reply.papertrans.cn/16/1526/152559/152559_13.png
启发
发表于 2025-3-24 01:08:06
http://reply.papertrans.cn/16/1526/152559/152559_14.png
法律
发表于 2025-3-24 05:07:55
https://doi.org/10.1007/978-3-319-59806-2algebraic coding theory; frobenius rings; MacWilliams relations; codes over rings; codes over finite rin
Contend
发表于 2025-3-24 10:35:46
Ring Theory,robenius rings and characterize them in terms of characters. We prove the generalized Chinese Remainder Theorem and describe what constitutes a minimal generating set for a code over a finite Frobenius ring.
新娘
发表于 2025-3-24 12:22:46
MacWilliams Relations,ults of algebraic coding theory. We describe them first for codes over groups and extend this to codes over Frobenius rings. Finally, we give a practical guide for producing MacWilliams relations for a specific ring.
人类学家
发表于 2025-3-24 16:25:06
http://reply.papertrans.cn/16/1526/152559/152559_18.png
灰姑娘
发表于 2025-3-24 20:53:24
Fabio Fossa,Luca Paparusso,Francesco Braghinrobenius rings and characterize them in terms of characters. We prove the generalized Chinese Remainder Theorem and describe what constitutes a minimal generating set for a code over a finite Frobenius ring.
Mundane
发表于 2025-3-25 01:01:28
Shrey Verma,Simon Parkinson,Saad Khanults of algebraic coding theory. We describe them first for codes over groups and extend this to codes over Frobenius rings. Finally, we give a practical guide for producing MacWilliams relations for a specific ring.