On quasi-cyclic codes with rate l m (Corresp.)
- 1 September 1978
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 24 (5) , 628-630
- https://doi.org/10.1109/tit.1978.1055929
Abstract
An integer linear programming problem and an additional divisibility condition are described such that they have a common solution if and only if there is a quasi-cyclic code with rate1/m. A table of binary quasi-cyclic codes with dimensions seven and eight and rate1/mfor smallmis included. In particular, there are binary linear codes with (length, dimension, minimum distance)=(35, 7,16), (42, 7,19), (80, 8, 37), (96, 8, 46), and(112,8,54).Keywords
This publication has 2 references indexed in Scilit:
- Binary codes with improved minimum weights (Corresp.)IEEE Transactions on Information Theory, 1976
- Minimum-distance bounds for binary linear codesIEEE Transactions on Information Theory, 1973