No label defined (Q3820532)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4093363
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 4093363

      Statements

      0 references
      0 references
      1988
      0 references
      Generalized Hadamard matrices
      0 references
      maximal codes
      0 references
      maximum distance
      0 references
      Reed- Solomon codes
      0 references
      block codes over non-binary alphabets
      0 references
      multiple channel encoding
      0 references
      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.
      0 references

      Identifiers