The dimension and minimum distance of two classes of primitive BCH codes
Authors:
- Cunsheng DingCDCunsheng Ding
- Cuiling FanCFCuiling Fan
- Zhengchun ZhouZZZhengchun Zhou
Top Cited Papers
- 1 May 2017
- journal article
- Published by Elsevier in Finite Fields and Their Applications
- Vol. 45, 237-263
Abstract
No abstract availableAll Related Versions
This publication has 23 references indexed in Scilit:
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing SchemesIEEE Transactions on Information Theory, 2005
- How to Build Robust Shared Control SystemsDesigns, Codes and Cryptography, 1998
- Further evaluations of Weil sumsActa Arithmetica, 1998
- On Coset Weight Distributions of the 3-Error-Correcting BCH-CodesSIAM Journal on Discrete Mathematics, 1997
- Weight distributions of cosets of two-error-correcting binary BCH codes, extended or notIEEE Transactions on Information Theory, 1994
- Idempotents and the BCH boundIEEE Transactions on Information Theory, 1994
- Studying the locator polynomials of minimum weight codewords of BCH codesIEEE Transactions on Information Theory, 1992
- On a class of primitive BCH-codesIEEE Transactions on Information Theory, 1990
- On subfield subcodes of modified Reed-Solomon codes (Corresp.)IEEE Transactions on Information Theory, 1975
- The Enumeration of Information Symbols in BCH CodesBell System Technical Journal, 1967