No label defined (Q4500983)

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 1498792
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 1498792

      Statements

      0 references
      0 references
      3 September 2000
      0 references
      linear codes
      0 references
      Griesmer codes
      0 references
      quaternary codes
      0 references
      An \([n,k,d;q]\) code is a linear code of length \(n\), dimension \(k\), and minimum distance \(d\) over \(GF(q)\). A code of length \(n\) is called a Griesmer code if \(n= \sum_{i=0}^{k-1}\lceil\frac{d}{q^i}\rceil .\) It is known that there exists a Griesmer \([q^3 -q^2 + 1,4,q^3 -2q^2 +q;q]\) code for any prime power \(q\geq 3\). With the help of a one-to-one correspondence between the set of nonequivalent Griesmer \([49,4,36;4]\) codes and the set of nonequivalent quaternary codes of length 19, dimension 4, and nonzero weight in the set \(\{12,16\}\), it is proven that there are exactly 4 nonequivalent Griesmer \([49,4,36;4]\) codes. For the entire collection see [Zbl 0918.00043].
      0 references

      Identifiers