We study weight distributions of shifts of codes from a well-known family: the 3-error-correcting binary nonlinear Goethals-like codes of length n = 2 m , where m ≥ 6 is even. These codes have covering radius ρ = 6. We know the weight distribution of any shift of weight i = 1, 2, 3, 5, or 6. For a shift of weight 4, the weight distribution is uniquely defined by the number of leaders in this shift, i.e., the number of vectors of weight 4. We also consider the weight distribution of shifts of codes with minimum distance 7 obtained by deleting any one position of a Goethals-like code of length n.
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