On weights in duadic Abelian codes

Authors:
Qiaoliang Li
Affiliations:
Department of Mathematics, Hunan Normal University, Changsha PRC and Center for Combinatorics, The Key Laboratory of Pure Mathematics and Combinatorics of Ministry of Education, Nankai University, ...
Venue:
Discrete Mathematics
Year:
2003

Citing 4
Cited 0

A course in number theory and cryptography

A course in number theory and cryptography
On weights in duadic codes

Journal of Combinatorial Theory Series A
Duadic codes and difference sets

Journal of Combinatorial Theory Series A
Existence of Abelian group code partitions

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	0.05

Visualization

Abstract

In this note, we prove that if C is a duadic binary abelian code with splitting µ = µ-1 and the minimum odd weight of C satisfies d2 - d + 1 ≠ n, then d(d-1) ≥ n + 11. We show by an example that this bound is sharp. A series of open problems on this subject are proposed.