On a (145, 32) binary cyclic code
- 1 January 1999
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 45 (7) , 2546-2547
- https://doi.org/10.1109/18.796404
Abstract
We discovered that a (145, 32) binary cyclic code generated by the product of an irreducible polynomial of degree 28 with exponent 145 and the polynomial x4+x3+x2+x+1 has a minimum distance of 44Keywords
This publication has 19 references indexed in Scilit:
- A decision feedback decorrelator for a dual rate synchronous DS/CDMA systemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Multi-code CDMA wireless personal communications networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Analysis of decorrelator-based receivers for multirate DS/CDMA communicationsIEEE Transactions on Vehicular Technology, 1999
- Inequalities for the trace of matrix productIEEE Transactions on Automatic Control, 1994
- Mobile access to an ATM network using a CDMA air interfaceIEEE Journal on Selected Areas in Communications, 1994
- MMSE interference suppression for direct-sequence spread-spectrum CDMAIEEE Transactions on Communications, 1994
- Limit of the Smallest Eigenvalue of a Large Dimensional Sample Covariance MatrixThe Annals of Probability, 1993
- A family of suboptimum detectors for coherent multiuser communicationsIEEE Journal on Selected Areas in Communications, 1990
- On random determinantsQuarterly of Applied Mathematics, 1989
- Matrix AnalysisPublished by Cambridge University Press (CUP) ,1985