Two new rate 2/p binary quasi-cyclic codes
- 1 January 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 40 (5) , 1667-1668
- https://doi.org/10.1109/18.333889
Abstract
A class of rate 2/P quasi-cyclic codes can be characterized in terms of m×m circulant matrices. In this correspondence, two new codes with parameters (80, 10, 35) and (95, 10, 42) are presented which improve the known lower bound on the maximum possible minimum distance. The former code can be extended with an even parity check bit to an (81, 10, 36) code that establishes that d2(81, 10)=36Keywords
This publication has 3 references indexed in Scilit:
- An updated table of minimum-distance bounds for binary linear codesIEEE Transactions on Information Theory, 1993
- Some best rate 1/p and rate (p-1)/p systematic quasi-cyclic codesIEEE Transactions on Information Theory, 1991
- Some results on quasi-cyclic codesInformation and Control, 1969