Computing in general Abelian groups is hard
Theoretical Computer Science
The Parametrized Complexity of Some Fundamental Problems in Coding Theory
SIAM Journal on Computing
Handbook of Coding Theory
Current Trends in Theoretical Computer Science: The Challenge of the New Century
Current Trends in Theoretical Computer Science: The Challenge of the New Century
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Proceedings of the 8th international conference on Developments in Language Theory
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
On minimum Lee weights of Hensel lifts of some binary BCH codes
IEEE Transactions on Information Theory
New Codes via the Lengthening of BCH Codes with UEP Codes
Finite Fields and Their Applications
On group automata over finite fields
Finite Fields and Their Applications
Hi-index | 0.00 |
This article develops a combinatorial algorithm for a class of codes extending BCH codes and constructed with finite state automata. Our algorithm computes the largest number of errors that the extended codes can correct, and finds a generator for each optimal code in this class of extensions. The question of finding codes with largest possible information rates remains open.