Cyclotomy and duadic codes of prime lengths

被引：35

作者：

Ding, CS ^{[1
]}

Pless, V

机构：

[1] Natl Univ Singapore, Sch Comp, Dept Comp Sci, Singapore 119260, Singapore

[2] Univ Illinois, Dept Math Stat & Comp Sci, Chicago, IL 60607 USA

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1999年 / 45卷 / 02期

关键词：

cyclotomy; duadic codes; quadratic residue; codes;

D O I：

10.1109/18.748995

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper we present a cyclotomic approach to the construction of all binary duadic codes of prime lengths. We calculate the number of all binary duadic codes for a given prime length and that of all duadic codes that are not quadratic residue codes. We give necessary and sufficient conditions for p such that all binary duadic codes of length p are quadratic residue (Q.R.) codes. We also show how to determine some weights of duadic codes with the help of cyclotomic numbers.

引用

页码：453 / 466

页数：14

共 17 条

[1] [Anonymous], FINITE FIELDS TH APP
[2] [Anonymous], J NUMBER THEORY
[3] [Anonymous], HDB CODING THEORY
[4] Cox D. A., 1989, PRIMES FORM X2 NY2 F
[5] Cyclotomy, higher congruences, and Waring's problem
Dickson, LE
[J]. AMERICAN JOURNAL OF MATHEMATICS, 1935, 57 : 391 - 424
[6] GAUSS CF, 1901, DISQUISITIONES ARITH
[7] THE AUTOMORPHISM-GROUPS OF THE GENERALIZED QUADRATIC RESIDUE CODES
HUFFMAN, WC
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1995, 41 (02) : 378 - 386
[8] ITO N, 1986, MATH J OKAYAMA U, V28, P1
[9] DUADIC CODES
LEON, JS
MASLEY, JM
PLESS, V
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1984, 30 (05) : 709 - 714
[10] A PROBABILISTIC ALGORITHM FOR COMPUTING MINIMUM WEIGHTS OF LARGE ERROR-CORRECTING CODES
LEON, JS
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1988, 34 (05) : 1354 - 1359

← 1 2 →