scientific article; zbMATH DE number 4093363
The analogue of Plotkin's bound for q-ary codes with high distance relative to length was given by \textit{I. F. Blake} and \textit{R. C. Mullin} [An introduction to algebraic and combinatorial coding theory (New York 1976)] as \[ A(n,d)\leq \frac{qd}{qd-n(q-1)},\quad qd>(q-1)n. \] Furhter we show \(A(n,(q-1)n/q)=qd,\quad qd=(q-1)n.\) Generalized Hadamard matrices are used to obtain q-ary codes which meet these bounds. The q-ary analogue of Levenshtein's construction is discussed and maximal codes constructed. The codes given are often maximum distance separable, and constructions are given which include the Reed-Solomon codes, but exist for cases when the Reed-Solomon codes cannot exist. We also study block codes over non-binary alphabets which may prove fruitful for multiple channel encoding.
- Cocyclic Hadamard matrices from forms over finite Frobenius rings
- Generalized Hadamard matrices which are developed modulo a group
- A class of \(q\)-ary codes
- Some remarks on the Plotkin bound
- Generalized Hadamard matrices and translations
- New nonbinary code bounds based on divisibility arguments
- An introduction to cocyclic generalised Hadamard matrices
- New lower bounds on \(q\)-ary error-correcting codes
- Multidimensional stochastic matrices and error-correcting codes
- scientific article; zbMATH DE number 3854971 (Why is no real title available?)
- A remark on Plotkin's bound
- scientific article; zbMATH DE number 840692 (Why is no real title available?)
- scientific article; zbMATH DE number 5593350 (Why is no real title available?)
- Small codes
- Good equidistant codes constructed from certain combinatorial designs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3820532)