Codes and designs

40% Rabatt

auf Fachbücher bei De Gruyter Brill *

Mit dem Code

DGBHOLIDAY40

Gültig bis zum 11. Dezember

* Es gelten die Aktionsbedingungen

Startseite Codes and designs

Artikel

Lizenziert

Nicht lizenziert Erfordert eine Authentifizierung

Veröffentlicht/Copyright: 9. Oktober 2009

Veröffentlicht von

Veröffentlichen auch Sie bei De Gruyter Brill

Informationen für Autor*innen Erkunden Sie dieses Fachgebiet

Aus der Zeitschrift Band 7 Heft 2

YUDIN, V. A.. "Codes and designs" Discrete Mathematics and Applications, vol. 7, no. 2, 1997, pp. 147-156. https://doi.org/10.1515/dma.1997.7.2.147

YUDIN, V. (1997). Codes and designs. Discrete Mathematics and Applications, 7(2), 147-156. https://doi.org/10.1515/dma.1997.7.2.147

YUDIN, V. (1997) Codes and designs. Discrete Mathematics and Applications, Vol. 7 (Issue 2), pp. 147-156. https://doi.org/10.1515/dma.1997.7.2.147

YUDIN, V. A.. "Codes and designs" Discrete Mathematics and Applications 7, no. 2 (1997): 147-156. https://doi.org/10.1515/dma.1997.7.2.147

YUDIN V. Codes and designs. Discrete Mathematics and Applications. 1997;7(2): 147-156. https://doi.org/10.1515/dma.1997.7.2.147

In die Zwischenablage kopiert

Published Online: 2009-10-09

Published in Print: 1997

Walter de Gruyter

Sie haben derzeit keinen Zugang zu diesem Inhalt.

Artikel in diesem Heft

On the complexity and depth of circuits that realize partial Boolean functions
On some properties of algebras with simple multiplication containing associative subalgebras
On the structure of the lattice of closed classes of polynomials
Codes and designs
On the minimal packing of a tree with fixed vertices
Characterization of some extremal graphs with diameter no greater than three
On the traversal of labyrinths by automata leaving unremovable labels
Approximate models of permutational automata
Limit theorems for the number of empty cells
Fourth Petrozavodsk Conference ‘Probabilistic Methods in Discrete Mathematics’

Zeitschrift durchsuchen In dieser Zeitschrift suchen

On the complexity and depth of circuits that realize partial Boolean functions
On some properties of algebras with simple multiplication containing associative subalgebras
On the structure of the lattice of closed classes of polynomials
Codes and designs
On the minimal packing of a tree with fixed vertices
Characterization of some extremal graphs with diameter no greater than three
On the traversal of labyrinths by automata leaving unremovable labels
Approximate models of permutational automata
Limit theorems for the number of empty cells
Fourth Petrozavodsk Conference ‘Probabilistic Methods in Discrete Mathematics’