Bounds on Spectra of Codes with Known Dual Distance
Designs, Codes and Cryptography
On the Distance Distributions of BCH Codes and Their Duals
Designs, Codes and Cryptography
Almost Orthogonal Linear Codes are Locally Testable
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Local list-decoding and testing of random linear codes from high error
Proceedings of the forty-second ACM symposium on Theory of computing
Some recent results on local testing of sparse linear codes
Property testing
Some recent results on local testing of sparse linear codes
Property testing
Long extended BCH codes are spanned by minimum weight words
AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
New Bounds on the Distance Distribution of Extended Goppa Codes
Finite Fields and Their Applications
Priority Based Error Correction Code (ECC) for the Embedded SRAM Memories in H.264 System
Journal of Signal Processing Systems
| Hi-index | 754.84 |
Derives an estimate for the error term in the binomial approximation of spectra of BCH codes. This estimate asymptotically improves on the bounds by Sidelnikov (1971), Kasami et al. (1985), and Sole (1990)