✦ LIBER ✦

Minimal Codes of Prime-Power Length

✍ Scribed by Manju Pruthi; S.K. Arora

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 247 KB
Volume: 3
Category: Article
ISSN: 1071-5797
DOI: 10.1006/ffta.1996.0156

No coin nor oath required. For personal study only.

✦ Synopsis

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 polynomial of the (n ϩ 1) minimum codes generated by the primitive idempotents are also obtained.

📜 SIMILAR VOLUMES

Minimal Cyclic Codes of Length 2pn

✍ S.K. Arora; Manju Pruthi 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 97 KB

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

A New Lower Bound on the Minimal Length

A New Lower Bound on the Minimal Length of a Binary Linear Code

✍ M.C. Bhandari; M.S. Garg 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 256 KB

Optimal binary covering codes of length

Optimal binary covering codes of length 2j

✍ William D. Weakley 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB

## 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

Groups of Prime Power Order with Derived

Groups of Prime Power Order with Derived Subgroup of Prime Order

✍ Simon R Blackburn 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 224 KB

The paper classifies (up to isomorphism) those groups of prime power order whose derived subgroups have prime order.

Roots of Polynomials Modulo Prime Powers

✍ Bruce Dearden; Jerry Metzger 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 202 KB

In general , not every set of values modulo n will be the set of roots modulo n of some polynomial . In this note , some characteristics of those sets which are root sets modulo a prime power are developed , and these characteristics are used to determine the number of dif ferent sets of integers wh

On the Prime Power Factorization of n!

✍ Yong-Gao Chen; Yao-Chen Zhu 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 105 KB

The parity of exponents in the prime power factorization of n! is considered. We extend and generalize Berend's result in [On the parity of exponents in the factorization of n!,