Balancing cyclic -ary Gray codes.
Flahive, Mary, Bose, Bella (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Balancing cyclic -ary Gray codes. II.”
Balancing cyclic -ary Gray codes.
A simple proof for the existence of exponentially balanced Gray codes.
Suparta, I Nengah (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On Multiple Deletion Codes
Landjev, Ivan, Haralambiev, Kristiyan (2007)
Serdica Journal of Computing
Similarity:
In 1965 Levenshtein introduced the deletion correcting codes and found an asymptotically optimal family of 1-deletion correcting codes. During the years there has been a little or no research on t-deletion correcting codes for larger values of t. In this paper, we consider the problem of finding the maximal cardinality L2(n;t) of a binary t-deletion correcting code of length n. We construct an infinite family of binary t-deletion correcting codes. By computer search, we construct t-deletion...
On the Weight Distribution of the Coset Leaders of Constacyclic Codes
Velikova, Evgeniya, Bojilov, Asen (2008)
Serdica Journal of Computing
Similarity:
Constacyclic codes with one and the same generator polynomial and distinct length are considered. We give a generalization of the previous result of the first author [4] for constacyclic codes. Suitable maps between vector spaces determined by the lengths of the codes are applied. It is proven that the weight distributions of the coset leaders don’t depend on the word length, but on generator polynomials only. In particular, we prove that every constacyclic code has the same weight distribution...
On a complete set of operations for factorizing codes
Clelia De Felice (2006)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
It is known that the class of factorizing codes, i.e., codes satisfying the factorization conjecture formulated by Schützenberger, is closed under two operations: the classical composition of codes and substitution of codes. A natural question which arises is whether a finite set of operations exists such that each factorizing code can be obtained by using the operations in and starting with prefix or suffix codes. is named here a complete set of operations (for factorizing codes)....
Divisible Codes - A Survey
Ward, Harold (2001)
Serdica Mathematical Journal
Similarity:
This paper surveys parts of the study of divisibility properties of codes. The survey begins with the motivating background involving polynomials over finite fields. Then it presents recent results on bounds and applications to optimal codes.
Ternary constant weight codes.
Östergård, Patric R.J., Svanström, Mattias (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Gray codes for -free strings.
Squire, Matthew B. (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the Error-Correcting Performance of some Binary and Ternary Linear Codes
Baicheva, Tsonka (2007)
Serdica Journal of Computing
Similarity:
In this work, we determine the coset weight spectra of all binary cyclic codes of lengths up to 33, ternary cyclic and negacyclic codes of lengths up to 20 and of some binary linear codes of lengths up to 33 which are distance-optimal, by using some of the algebraic properties of the codes and a computer assisted search. Having these weight spectra the monotony of the function of the undetected error probability after t-error correction P(t)ue (C,p) could be checked with any precision...
On optimal linear codes over .
Kanazawa, Rie, Maruta, Tatsuya (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Balanced Gray codes.
Bhat, Girish S., Savage, Carla D. (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity: