New upper bounds on Lee codes (Q2492226)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	New upper bounds on Lee codes	scientific article

Statements

scholarly article

0 references

New upper bounds on Lee codes (English)

0 references

zbMATH Open document ID

0 references

10.1016/j.dam.2006.01.009

0 references

Jörn Quistorff

0 references

Discrete Applied Mathematics

0 references

publication date

9 June 2006

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

Lee code

0 references

upper bound

0 references

tables

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.dam.2006.01.009

0 references

0 references

0 references

0 references

An Elias-type bound for Lee codes over large alphabets and its application to perfect codes (Corresp.)

0 references

THE LEE-SCHEME AND BOUNDS FOR LEE-CODES

0 references

0 references

Error-correcting codes over an alphabet of four elements

0 references

Bounds on codes over an alphabet of five elements

0 references

0 references

Fundamentals of Error-Correcting Codes

0 references

A modification of the elias-bound and nonexistence theorems for perfect codes in the Lee-metric

0 references

0 references

Some remarks on the Plotkin bound

0 references

0 references

Lee metric codes over integer residue rings (Corresp.)

0 references

Upper bounds for constant weight and Lee codes slightly outside the Plotkin range

0 references

Genetic algorithms in coding theory -- a table for \(A_ 3(n, d)\)

0 references

An upper bound on minimum distance for a k-ary code

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2492226

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