Explicit expressions for the (n Ο© 1) primitive idempotents in FG (the group algebra of the cyclic group G of order p n (p odd prime, n ΟΎ 1) over the finite field F of prime power order q where q is a primitive root modulo p n ) are obtained. The minimum distance, the dimension, and the generating po
Minimal Cyclic Codes of Length 2pn
β Scribed by S.K. Arora; Manju Pruthi
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 97 KB
- Volume
- 5
- Category
- Article
- ISSN
- 1071-5797
No coin nor oath required. For personal study only.
β¦ Synopsis
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 codes are obtained. We assume that F O "GF(q), where q (prime power) is primitive root modulo 2pL and n51 is an integer, and both p and q are odd.
π SIMILAR VOLUMES
## Abstract The minimum size of a binary covering code of length __n__ and covering radius __r__ is denoted by __K__(__n__,__r__), and codes of this length are called optimal. For __j__β>β0 and __n__β=β2^__j__^, it is known that __K__(__n__,1)β=β2βΒ·β__K__(__n__β1,1)β=β2^__nβββj__^. Say that two bin
In Langevin and Zanotti (1995), we introduced a new class of codes called balanced weight distribution (BWD)-codes, with the remarkable property that their weight distribution is balanced, i.e., there are the same number of codewords for each non-zero weight. The aim of this paper is to study the we
The classi"cation of all self-dual codes over 9 of length up to 15 and Type II codes of length 16 is known. In this note, we give a method to classify Type IV self-dual codes over 9 . As an application, we present the classi"cation of Type IV self-dual codes of length 16. There are exactly 11 inequ