The multicovering radii of linear codes with 1-covering radius one

A. Mertz

doi:10.1109/ISIT.2003.1228029

The multicovering radii of linear codes with 1-covering radius one

University of Kentucky

Producción científica › revisión exhaustiva

Idioma original	American English
Publicación	International Symposium on Information Theory
DOI	https://doi.org/10.1109/ISIT.2003.1228029
Estado	Published - ene 1 2003
Publicado de forma externa	Sí

Disciplines

Theory and Algorithms
Statistics and Probability
Mathematics
Discrete Mathematics and Combinatorics

Acceder al documento

10.1109/ISIT.2003.1228029Licencia: Unspecified

Otros archivos y enlaces

http://ieeexplore.ieee.org/document/1228029/

Citar esto

@article{23637f5920034675ae72ad2f29899095,

title = "The multicovering radii of linear codes with 1-covering radius one",

author = "A. Mertz",

note = "The multicovering radius is a generalization of the covering radius that was proposed by Klapper (1997) in the course of studying stream ciphers. Klapper s",

year = "2003",

month = jan,

day = "1",

doi = "10.1109/ISIT.2003.1228029",

language = "American English",

journal = "International Symposium on Information Theory",

}

TY - JOUR

T1 - The multicovering radii of linear codes with 1-covering radius one

AU - Mertz, A.

N1 - The multicovering radius is a generalization of the covering radius that was proposed by Klapper (1997) in the course of studying stream ciphers. Klapper s

PY - 2003/1/1

Y1 - 2003/1/1

UR - http://ieeexplore.ieee.org/document/1228029/

U2 - 10.1109/ISIT.2003.1228029

DO - 10.1109/ISIT.2003.1228029

M3 - Article

JO - International Symposium on Information Theory

JF - International Symposium on Information Theory

ER -