Add to ORKGThe results of the study are not primitive BCH codes with decoding the guide, the potential is much greater than the design possibilities. The efficiency of automorphisms of codes, norms theory syndromes in the correction of all admissible-Mykh minimum distances errors in the above code is shown
The binary primitive BCH codes are cyclic and are constructed by choosing a subset of the cyclotomic...
A new class of error-correcting codes, which generalizes the BCH codes and the polynomial codes of G...
We construct a large number of record-breaking binary, ternary and quaternary codes. Our methods inv...
Integrated studies completion of BCH codes of different lengths is devoted. Most attention is paid t...
The complexity of the norm decoding is exanimated. The results of computational experiments in the n...
One of the central topics in coding theory is the study of error detection and correction, where cod...
The article addresses the further development of methods of BCH codes norm decoding. The authors pro...
Norming decoding based on cyclotomic classes with main and subordinate norms is exanimated. It was f...
It is shown that every optimal binary code with covering radius R=1 is normal. This (parity) proves ...
Error correction capability of unguaranteed errors multiplicity by codes BCH based on the norming de...
Using equivalent codes it is shown that the BCH-bound for the following narrowsense BCH-codes alread...
It is shown how binary polynomial residue codes which are equivalent in error-correcting power to sh...
Bose-Chaudhuri-Hocquenghem (BCH) codes are very powerful random error-correcting techniques. We have...
The purpose of this work with its results presented in the article was to develop and transfer to th...
Proposes some simple algorithms for decoding BCH codes. The authors show that the pruned FFT is an e...
The binary primitive BCH codes are cyclic and are constructed by choosing a subset of the cyclotomic...
A new class of error-correcting codes, which generalizes the BCH codes and the polynomial codes of G...
We construct a large number of record-breaking binary, ternary and quaternary codes. Our methods inv...
Integrated studies completion of BCH codes of different lengths is devoted. Most attention is paid t...
The complexity of the norm decoding is exanimated. The results of computational experiments in the n...
One of the central topics in coding theory is the study of error detection and correction, where cod...
The article addresses the further development of methods of BCH codes norm decoding. The authors pro...
Norming decoding based on cyclotomic classes with main and subordinate norms is exanimated. It was f...
It is shown that every optimal binary code with covering radius R=1 is normal. This (parity) proves ...
Error correction capability of unguaranteed errors multiplicity by codes BCH based on the norming de...
Using equivalent codes it is shown that the BCH-bound for the following narrowsense BCH-codes alread...
It is shown how binary polynomial residue codes which are equivalent in error-correcting power to sh...
Bose-Chaudhuri-Hocquenghem (BCH) codes are very powerful random error-correcting techniques. We have...
The purpose of this work with its results presented in the article was to develop and transfer to th...
Proposes some simple algorithms for decoding BCH codes. The authors show that the pruned FFT is an e...
The binary primitive BCH codes are cyclic and are constructed by choosing a subset of the cyclotomic...
A new class of error-correcting codes, which generalizes the BCH codes and the polynomial codes of G...
We construct a large number of record-breaking binary, ternary and quaternary codes. Our methods inv...