Change language
English Deutsch
Change currency
€ EUR £ GBP $ USD
Licensed Unlicensed Requires Authentication Published by De Gruyter October 8, 2009

Kerdock code in a cyclic form

  • A. A. NECHAEV
From the journal Discrete Mathematics and Applications
https://doi.org/10.1515/dma.1991.1.4.365
Published Online: 2009-10-08
Published in Print: 1991

Walter de Gruyter

From the journal
Discrete Mathematics and Applications
Discrete Mathematics and Applications
Volume 1 Issue 4

Journal and Issue

Articles in the same Issue

The Newton sums method in combinatorial optimization
Kerdock code in a cyclic form
On the conditions of regularity for finite autonomous automata
On lower bounds for the time of computation
Stochasticity of the languages acceptable by two-way finite probabilistic automata
On completeness of the binary boundedly determined functions with respect to superposition
Weighings, allocations, and the embeddability of partitions
On the circle method
Distribution of the permanent of a random Boolean matrix
Downloaded on 29.5.2024 from https://www.degruyter.com/document/doi/10.1515/dma.1991.1.4.365/html
Scroll to top button