Scholars@Duke

A Square Root Bound on the Minimum Weight in Quasi-Cyclic Codes

Publication ,  Journal Article
Calderbank, R
Published in: IEEE Transactions on Information Theory
January 1, 1983
Published version (DOI)

We establish a square root bound on the minimum weight in the quasi-cyclic binary codes constructed by Bhargava, Tavares, and Shiva. The proof rests on viewing the codes as ideals in a group algebra over GF (4). Theorem 6 answers a question raised by F. J. MacWilliams and N. J. A. Sloane in The Theory of Error-Correcting Codes. Theorems 3, 4, and 5 provide information about the way the nonzero entries of a codeword of minimum weight are distributed among the coordinate positions. © 1983 IEEE

Duke Scholars

Robert Calderbank
Author Robert Calderbank Computer Science

Published In

IEEE Transactions on Information Theory

DOI

10.1109/TIT.1983.1056673

EISSN

1557-9654

ISSN

0018-9448

Publication Date

January 1, 1983

Volume

29

Issue

3

Start / End Page

332 / 337

Related Subject Headings

  • Networking & Telecommunications
  • 4613 Theory of computation
  • 4006 Communications engineering
  • 1005 Communications Technologies
  • 0906 Electrical and Electronic Engineering
  • 0801 Artificial Intelligence and Image Processing
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Calderbank, R. (1983). A Square Root Bound on the Minimum Weight in Quasi-Cyclic Codes. IEEE Transactions on Information Theory, 29(3), 332–337. https://doi.org/10.1109/TIT.1983.1056673
Calderbank, R. “A Square Root Bound on the Minimum Weight in Quasi-Cyclic Codes.” IEEE Transactions on Information Theory 29, no. 3 (January 1, 1983): 332–37. https://doi.org/10.1109/TIT.1983.1056673.
Calderbank R. A Square Root Bound on the Minimum Weight in Quasi-Cyclic Codes. IEEE Transactions on Information Theory. 1983 Jan 1;29(3):332–7.
Calderbank, R. “A Square Root Bound on the Minimum Weight in Quasi-Cyclic Codes.” IEEE Transactions on Information Theory, vol. 29, no. 3, Jan. 1983, pp. 332–37. Scopus, doi:10.1109/TIT.1983.1056673.
Calderbank R. A Square Root Bound on the Minimum Weight in Quasi-Cyclic Codes. IEEE Transactions on Information Theory. 1983 Jan 1;29(3):332–337.

Published In

IEEE Transactions on Information Theory

DOI

10.1109/TIT.1983.1056673

EISSN

1557-9654

ISSN

0018-9448

Publication Date

January 1, 1983

Volume

29

Issue

3

Start / End Page

332 / 337

Related Subject Headings

  • Networking & Telecommunications
  • 4613 Theory of computation
  • 4006 Communications engineering
  • 1005 Communications Technologies
  • 0906 Electrical and Electronic Engineering
  • 0801 Artificial Intelligence and Image Processing