Indecomposability of cyclic codes
β Scribed by Yoshimi Kashiwagi; Isao Kikumasa
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 277 KB
- Volume
- 196
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
but it is not true in general. In fhis paper we will give a necessary and sufficient condition for a cyclic code to be indecomposable, using its generator polynomial.
π SIMILAR VOLUMES
We determine all indecomposable codes over a class of Hopf algebras named Taft Algebras. We calculate dual codes and tensor products of these indecomposable codes and give applications of them.
In memory of Professor Gian-Carlo Rota for his great contributions in combinatorial and discrete geometry A set of n-tuples over 8 is called a code over 8 or a 8 code if it is a 8 module. A particularly interesting family of 8 -cyclic codes are quadratic residue codes. We define such codes in terms
Let r, n be integers, -n < r < n. An n x n matrix A is called r-indecomposable if it contains no k x I zero submatrix with k + ! = n -r + 1. If A is primitive, then there is a smallest positive integer, h~.(A), such that A'" is r-indecomposable for all m >1 hi'.(A). The integer h,: (A) is called the