Let [n, k, d] q codes be linear codes of length n, dimension k, and minimum Hamming distance d over GF(q). Let n q (k, d) be the smallest value of n for which there exists an [n, k, d] q code. It is known from [1, 2] that 284 ≤ n 3(6, 188) ≤ 285 and 285 ≤ n 3(6, 189) ≤ 286. In this paper, the nonexistence of [284, 6, 188]3 codes is proved, whence we get n 3(6, 188) = 285 and n 3(6, 189) = 286.
Problems of Information Transmission – Springer Journals
Published: Dec 16, 2004
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud