Computing in general Abelian groups is hard
Theoretical Computer Science
Introduction to finite fields and their applications
Introduction to finite fields and their applications
Algorithmic graph theory
Introduction to algorithms
Finite fields
The Parametrized Complexity of Some Fundamental Problems in Coding Theory
SIAM Journal on Computing
Handbook of Coding Theory
Compression and Coding Algorithms
Compression and Coding Algorithms
Fundamentals of Computer Security
Fundamentals of Computer Security
Information Rates and Weights of Codes in Structural Matrix Rings
AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
A polynomial algorithm for codes based on directed graphs
CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51
Data Structures and Algorithms in Java
Data Structures and Algorithms in Java
(a,d)-edge-antimagic total labelings of caterpillars
IJCCGGT'03 Proceedings of the 2003 Indonesia-Japan joint conference on Combinatorial Geometry and Graph Theory
Δ-Optimum exclusive sum labeling of certain graphs with radius one
IJCCGGT'03 Proceedings of the 2003 Indonesia-Japan joint conference on Combinatorial Geometry and Graph Theory
On the decoding of Reed-Solomon and BCH codes over integer residue rings
IEEE Transactions on Information Theory
Finding short and light codewords in BCH codes
IEEE Transactions on Information Theory
On minimum Lee weights of Hensel lifts of some binary BCH codes
IEEE Transactions on Information Theory
On generalized Hamming weights of BCH codes
IEEE Transactions on Information Theory
Extending and LengtheningBCHCodes
Finite Fields and Their Applications
New Codes via the Lengthening of BCH Codes with UEP Codes
Finite Fields and Their Applications
Parameterized Complexity
| Hi-index | 0.00 |
This paper develops combinatorial algorithms for computing parameters of extensions of BCH codes based on directed graphs. One of our algorithms generalizes and strengthens a previous result obtained in the literature before.