We consider nonbinary codes with growing length and fixed distance. Linear double-error correcting codes over an arbitrary field GF(q) with length n = qm ...

Nonbinary codes with growing length and fixed distance are considered and linear double-error correcting codes over an arbitrary field GF(q) with length n ...

Long nonbinary codes exceeding the Gilbert-Varshamov bound for any fixed distance. Let A(q,n,d) denote the maximum size of a q-ary code of length n and distance ...

Let us consider a q-ary code V(q, n, d) of length n, with Hamming distance d > 3 and redundancy r(Y) = n - logq IV[, where IV[ denotes the cardinality of.

Jun 21, 2004 · Long Nonbinary Codes Exceeding the Gilbert - Varshamov Bound for any Fixed Distance. Authors:Sergey Yekhanin, Ilya Dumer.

Prior to this work, codes of fixed distance that asymptotically surpass BCH codes and the Gilbert-Varshamov bound were designed only for distances 4,5 and 6.

Oct 22, 2024 · There have been numerous studies on low redundancy Hamming metric codes with fixed Hamming distance (see [2] for instance). In particular, we ...

2001. ABSTRACT. We use the polynomial method to derive upper and lower bounds on the distance distribution of nonbinary codes in the Hamming space.

A method for decoding RS (Reed Solomon) codes which used fixed decoding time and does not depend upon the number of errors present in messages is presented.

Prior to this work, codes of fixed distance that asymptotically surpass BCH codes and the Gilbert-Varshamov bound were designed only for distances 4,5, and 6.