We suggest a construction of perfect q-ary codes by sequential switchings of special-type components (called simple components) of the Hamming code. We prove that such components are minimal. The construction yields a lower bound on the number of different q-ary codes; this is presently the best known bound. We show that this bound cannot be substantially improved using switchings of components of this type.
Problems of Information Transmission – Springer Journals
Published: Apr 20, 2006
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