A note on cyclic codes over of length
โ Scribed by R. Sobhani; M. Esmaeili
- Book ID
- 108131484
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 133 KB
- Volume
- 15
- Category
- Article
- ISSN
- 1071-5797
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We extend the results of [J.F. Qian, L.N. Zhang, S.X. Zhu, (1 + u)-constacyclic and cyclic codes over F 2 + uF
A method of investigating the minimum distance of binary cyclic codes of composite blocklength is described; only the case of blocklength 63 is discussed in any detail. Moreover, the usefulness of the method is left as an unanswered question. 'Your proof of Theorem 5.9.2 is the same as the one in M
In this paper we completely describe the 2n#2 minimal cyclic codes of length 2pL over F O , as minimal ideals in the ring R"F O [x]/1xN L !12 in terms of their generating idempotents. Explicit expressions for the primitive idempotents, generating polynomials, minimum distance, and dimension of these