Bounds for covering codes over large alphabets
G Kéri, PRJ Östergård - Designs, Codes and Cryptography, 2005 - Springer
Let K q (n, R) denote the minimum number of codewords in any q-ary code of length n and
covering radius R. We collect lower and upper bounds for K q (n, R) where 6≤ q≤ 21 and …
covering radius R. We collect lower and upper bounds for K q (n, R) where 6≤ q≤ 21 and …
[PDF][PDF] Bounds for Covering Codes over Large Alphabets
G KÉRI, PRJ ÖSTERGÅRD - Designs, Codes and Cryptography, 2005 - academia.edu
Let Kq (n, R) denote the minimum number of codewords in any q-ary code of length n and
covering radius R. We collect lower and upper bounds for Kq (n, R) where 6≤ q≤ 21 and …
covering radius R. We collect lower and upper bounds for Kq (n, R) where 6≤ q≤ 21 and …
[引用][C] Bounds for covering codes over large alphabets
G Kéri, PRJ Östergard - DESIGNS CODES AND CRYPTOGRAPHY, 2005 - eprints.sztaki.hu
Bounds for covering codes over large alphabets - SZTAKI Publication Repository SZTAKI
Publication Repository SZTAKI HUN-REN SZTAKI Hungarian Research Network Institute for …
Publication Repository SZTAKI HUN-REN SZTAKI Hungarian Research Network Institute for …
Bounds for Covering Codes over Large Alphabets
G Kéri, PRJ Östergård - Designs, Codes and Cryptography, 2005 - infona.pl
Let K q (n, R) denote the minimum number of codewords in any q-ary code of length n and
covering radius R. We collect lower and upper bounds for K q (n, R) where 6≤ q≤ 21 and …
covering radius R. We collect lower and upper bounds for K q (n, R) where 6≤ q≤ 21 and …
[引用][C] Bounds for covering codes over large alphabets
G Kéri, P Östergård - Designs Codes and Cryptography, 2005 - research.aalto.fi
Bounds for covering codes over large alphabets — Aalto University's research portal Skip to
main navigation Skip to search Skip to main content Aalto University's research portal Home …
main navigation Skip to search Skip to main content Aalto University's research portal Home …
Bounds for Covering Codes over Large Alphabets
G Kéri, PR Östergård - Designs, Codes and Cryptography, 2005 - dl.acm.org
Let K q (n, R) denote the minimum number of codewords in any q-ary code of length n and
covering radius R. We collect lower and upper bounds for K q (n, R) where 6 q 21 and R 3 …
covering radius R. We collect lower and upper bounds for K q (n, R) where 6 q 21 and R 3 …
[引用][C] Bounds for covering codes over large alphabets
G Kéri, PRJ Östergard - DESIGNS CODES AND CRYPTOGRAPHY, 2005 - eprints.sztaki.hu
Bounds for covering codes over large alphabets - SZTAKI Publication Repository SZTAKI
Publication Repository SZTAKI HUN-REN SZTAKI Hungarian Research Network Institute for …
Publication Repository SZTAKI HUN-REN SZTAKI Hungarian Research Network Institute for …
[引用][C] Bounds for covering codes over large alphabets
G Kéri, PRJ Östergård - 2003 - research.aalto.fi
Bounds for covering codes over large alphabets — Aalto University's research portal Skip to
main navigation Skip to search Skip to main content Aalto University's research portal Home …
main navigation Skip to search Skip to main content Aalto University's research portal Home …