Modular and p-adic cyclic codes

Details Modular and p-adic cyclic codes Modular and p-adic cyclic codes

2003-11-18

arxiv.org/abs/math/0311319v1

Designs, Codes and Cryptography, Vol. 6 (1995), 21-35

Mathematics

Combinatorics

18 pages

Scientific paper

This paper presents some basic theorems giving the structure of cyclic codes of length n over the ring of integers modulo p^a and over the p-adic numbers, where p is a prime not dividing n. An especially interesting example is the 2-adic cyclic code of length 7 with generator polynomial X^3 + lambda X^2 + (lambda - 1) X - 1, where lambda satisfies lambda^2 - lambda + 2 =0. This is the 2-adic generalization of both the binary Hamming code and the quaternary octacode (the latter being equivalent to the Nordstrom-Robinson code). Other examples include the 2-adic Golay code of length 24 and the 3-adic Golay code of length 12.

Affiliated with

Also associated with

No associations

Rating

Modular and p-adic cyclic codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Modular and p-adic cyclic codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Modular and p-adic cyclic codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-191433