Some Remarks on BCH Bounds and Minimum Weights of Binary Primitive BCH Codes
IEEE Transactions on Information Theory
On modular weight and cyclic nonadjacent forms for arithmetic codes (Corresp.)
IEEE Transactions on Information Theory
Complete decoding of triple-error-correcting binary BCH codes
IEEE Transactions on Information Theory
All binary 3-error-correcting BCH codes of length have covering radius 5 (Corresp.)
IEEE Transactions on Information Theory
On the inherent intractability of certain coding problems (Corresp.)
IEEE Transactions on Information Theory
Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
On the covering radius of certain cyclic codes
AAECC'03 Proceedings of the 15th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Improved bounds on weil sums over galois rings and homogeneous weights
WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
| Hi-index | 0.04 |
The problem of finding the covering radius and minimum distance of algebraic and arithmetic codes is shown to be related to Waring's problem in a finite field and to the theory of cyclotomic numbers. The methods developed lead to new results for the covering radius of certain t-error-correcting BCH codes. Further, new results are given for the covering radius and the minimum distance of some classes of arithmetic codes generated by prime numbers.