Results 181 to 190 of about 672 (207)
Some of the next articles are maybe not open access.

Factorization of cyclic codes

IEEE Transactions on Information Theory, 1967
A subclass of cyclic codes of composite block length n=n' \cdot n" , with n' and n" relatively prime, is studied. It is shown how, under certain conditions, these codes may be factorized into subcodes of block length n' and n" and how they are related to codes of block length n' or n" , over extension fields of the base field.
openaire   +2 more sources

Locally testable cyclic codes

44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings., 2004
Cyclic linear codes of block length n over a finite field F/sub q/ are linear subspaces of F/sub q//sup n/ that are invariant under a cyclic shift of their coordinates. A family of codes is good if all the codes in the family have constant rate and constant normalized distance (distance divided by block length).
László Babai   +2 more
openaire   +1 more source

The genetic code and cyclic codes.

Comptes rendus de l'Academie des sciences. Serie III, Sciences de la vie, 1983
We proposed previously a cyclic code made of 22 triplets, which we now call the AB code. It is made up of the following chain: AUGGUGCCAUUCAAGACUAUGA. The letters A, U, C, G represent the classical symbols of the (purine and pyrimidine) bases of the genetic code.
J, Demongeot, J, Besson
openaire   +2 more sources

BCH cyclic codes

Discrete Mathematics
BCH codes are a subclass of cyclic codes with many interesting properties. Over the last sixty years, a lot of progress has been made in the study of BCH codes. This survey paper presents the state-of-the-art of BCH cyclic codes and their applications.
Ding, Cunsheng, Li, Chengju
openaire   +3 more sources

Important cyclic codes

1971
We now introduce a set of multiple-error correcting codes which were discovered by R. C. Bose and D. K. Ray-Chaudhuri and independently by A. Hocquenghem and which are now known as BCH-codes.
openaire   +1 more source

On Cyclic MDS-Codes

2000
We investigate the question when a cyclic code is maximum distance separable (MDS). For codes of (co-)dimension 3, this question is related to permutation properties of the polynomial (x b -1)/(x-1) for a certain b. Using results on these polynomials we prove that over fields of odd characteristic the only MDS cyclic codes of dimension 3 are the Reed ...
openaire   +1 more source

Skew cyclic codes of arbitrary length

International Journal of Information and Coding Theory, 2011
Padmapani Seneviratne   +2 more
exaly  

Hamming weights in irreducible cyclic codes

Discrete Mathematics, 2013
Ding Cunsheng
exaly  

LCD Cyclic Codes Over Finite Fields

IEEE Transactions on Information Theory, 2017
Ding Cunsheng, Chengju Li, Shuxing Li
exaly  

Three-weight cyclic codes and their weight distributions

Discrete Mathematics, 2016
Ding Cunsheng   +2 more
exaly  

Home - About - Disclaimer - Privacy