… Prior to this work, codes of fixed distance that asymptotically surpass BCH codes and the
Gilbert–… We have constructed an infinite family of nonbinary codes that reduce the asymptotic …

… 121 is of a distance at least two away from the other words of the code. We note that each
member c of the code C has exactly six neighboring words in S with distance one away. These …

… provide an upper bound on the minimum distance for nonbinary quasi-cyclic LDPC codes. …
distances for nonbinary LDPC codes. We incorporate a local search based on the code’s …

… This technique readily extends to nonbinary codes; indeed, most of the necessary … classical
nonbinary codes are the maximum-distance separable (MDS) codes, that is, codes that meet …

… for correcting single small errors, and for correcting single small errors and detecting double
small errors, in a message of arbitrary length, for an arbitrary number of di_flerent signals in …

… Bounds on minimum distance and covering radius have attracted a great deal … non-binary
codes. The best presently known upper bound on the minimum distance of non-binary codes …

… In this paper we consider nonbinary codes based on bipartite graphs. The idea of codes on
… asymptotically good codes with simple decoding (by “asymptotically good codes” we mean …

… code search as a function of the code length. We assume that the size (c − b) × c of the base
matrix is fixed and that … codelength is provided by increasing the lifting degree (TB length) M. …

… logarithmic minimum distance of nonbinary codes, using a strategy similar to the girth bound
for binary codes. This bound has the same asymptotic behaviour as that of binary codes. …

… This paper also derives lower and upper bounds on the minimum distance of stabilizer
codes, gives several code constructions, and derives numerous families of stabilizer …