Access the full text.
Sign up today, get DeepDyve free for 14 days.
(2013)
Computing Distance Distributions of Orthogonal Arrays, in Proc. 12th Int. Workshop on Algebraic and Combinatorial Coding Theory (ACCT’2010), Academgorodok, Novosibirsk, Russia, Novosibirsk
(1965)
Translated under the title Spravochnik po spetsial'nym funktsiyam s formulami, grafikami i matematicheskimi tablitsami
(1965)
Handbook of Mathematical Functions, with Formulas, Graphs, and Mathematical Tables
P Boyvalenkov, H Kulina (2010)
Proc. 12th Int. Workshop on Algebraic and Combinatorial Coding Theory (ACCT’2010), Academgorodok, Novosibirsk, Russia
AS Hedayat, NJA Sloane, J Stufken (1999)
Orthogonal Arrays: Theory and Applications
V. Levenshtein (1998)
Universal bounds for codes and designs, in Handbookof Coding Theory
VI Levenshtein (1998)
Handbook of Coding Theory
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
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.