We show how one can use polynomial techniques to compute all possible distance distributions of binary orthogonal arrays (OAs) of relatively small lengths and strengths. Then we exploit certain connections between OAs and their derived OAs. Having all distance distributions of OAs under consideration, we are able to test them aimed at classification results.
Problems of Information Transmission – Springer Journals
Published: Jan 25, 2014
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