Optimal ternary linear codes (Q1200308)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Optimal ternary linear codes	scientific article

Statements

scholarly article

0 references

Optimal ternary linear codes (English)

0 references

zbMATH Open document ID

0 references

10.1007/BF00124893

0 references

0 references

0 references

Designs, Codes and Cryptography

0 references

publication date

16 January 1993

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

optimal ternary linear codes

0 references

MaRDI profile type

MaRDI publication profile

0 references

Minimum block length of a linear q-ary code with specified dimension and code distance

0 references

New bounds on binary linear codes of dimension eight (Corresp.)

0 references

The packing problem for projective geometries over GF(3) with dimension greater than five

0 references

Optimal ternary quasi-cyclic codes

0 references

A Bound for Error-Correcting Codes

0 references

A survey of recent works with respect to a characterization of an (n,k,d;q)-code meeting the Griesmer bound using a min\(\cdot hyper\) in a finite projective geometry

0 references

Minimum-distance bounds for binary linear codes

0 references

0 references

0 references

0 references

0 references

Optimal ternary linear codes

0 references

0 references

Algebraically punctured cyclic codes

0 references

The smallest length of binary 7-dimensional linear codes with prescribed minimum distance

0 references

An updated table of minimum-distance bounds for binary linear codes

0 references

There is no binary (25,8,10) code

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1200308

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1200308&oldid=34096571"