SQUARE ROOT BOUND ON THE MINIMUM WEIGHT IN QUASI-CYCLIC CODES.
Publication
, Journal Article
Calderbank, R
Published in: IEEE Transactions on Information Theory
1983
The author establishes a square root bound on the minimum weight in the quasi-cyclic binary codes constructed by V. K. Bhargava, S. E. Tavares, and S. G. S. Shiva. The proof rests on viewing the codes as ideas in a group algebra over GF.
Duke Scholars
Published In
IEEE Transactions on Information Theory
Publication Date
1983
Volume
IT-29
Issue
3
Start / End Page
332 / 337
Related Subject Headings
- Networking & Telecommunications
- 1005 Communications Technologies
- 0906 Electrical and Electronic Engineering
- 0801 Artificial Intelligence and Image Processing
Citation
APA
Chicago
ICMJE
MLA
NLM
Calderbank, R. (1983). SQUARE ROOT BOUND ON THE MINIMUM WEIGHT IN QUASI-CYCLIC CODES. IEEE Transactions on Information Theory, IT-29(3), 332–337.
Calderbank, R. “SQUARE ROOT BOUND ON THE MINIMUM WEIGHT IN QUASI-CYCLIC CODES.” IEEE Transactions on Information Theory IT-29, no. 3 (1983): 332–37.
Calderbank R. SQUARE ROOT BOUND ON THE MINIMUM WEIGHT IN QUASI-CYCLIC CODES. IEEE Transactions on Information Theory. 1983;IT-29(3):332–7.
Calderbank, R. “SQUARE ROOT BOUND ON THE MINIMUM WEIGHT IN QUASI-CYCLIC CODES.” IEEE Transactions on Information Theory, vol. IT-29, no. 3, 1983, pp. 332–37.
Calderbank R. SQUARE ROOT BOUND ON THE MINIMUM WEIGHT IN QUASI-CYCLIC CODES. IEEE Transactions on Information Theory. 1983;IT-29(3):332–337.
Published In
IEEE Transactions on Information Theory
Publication Date
1983
Volume
IT-29
Issue
3
Start / End Page
332 / 337
Related Subject Headings
- Networking & Telecommunications
- 1005 Communications Technologies
- 0906 Electrical and Electronic Engineering
- 0801 Artificial Intelligence and Image Processing