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

Research output: Contribution to journal › Article › peer-review

Original language	American English
Journal	International Symposium on Information Theory
DOIs	https://doi.org/10.1109/ISIT.2003.1228029
State	Published - Jan 1 2003
Externally published	Yes

Disciplines

Theory and Algorithms
Statistics and Probability
Mathematics
Discrete Mathematics and Combinatorics

Access to Document

10.1109/ISIT.2003.1228029License: Unspecified

Cite this

@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 -

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

Disciplines

Access to Document

Other files and links

Cite this