The automorphism groups of certain codes

M. I. Anokhin

doi:10.1515/dma-2012-002

Home The automorphism groups of certain codes

Article

Licensed

Unlicensed Requires Authentication

The automorphism groups of certain codes

M. I. Anokhin

Published/Copyright: April 24, 2012

Published by

Become an author with De Gruyter Brill

Author Information Explore this Subject

From the journal Discrete Mathematics and Applications Volume 22 Issue 1

MLA
APA
Harvard
Chicago
Vancouver

MLA
APA
Harvard
Chicago
Vancouver

Anokhin, M. I.. "The automorphism groups of certain codes" Discrete Mathematics and Applications, vol. 22, no. 1, 2012, pp. 23-36. https://doi.org/10.1515/dma-2012-002

Anokhin, M. (2012). The automorphism groups of certain codes. Discrete Mathematics and Applications, 22(1), 23-36. https://doi.org/10.1515/dma-2012-002

Anokhin, M. (2012) The automorphism groups of certain codes. Discrete Mathematics and Applications, Vol. 22 (Issue 1), pp. 23-36. https://doi.org/10.1515/dma-2012-002

Anokhin, M. I.. "The automorphism groups of certain codes" Discrete Mathematics and Applications 22, no. 1 (2012): 23-36. https://doi.org/10.1515/dma-2012-002

Anokhin M. The automorphism groups of certain codes. Discrete Mathematics and Applications. 2012;22(1): 23-36. https://doi.org/10.1515/dma-2012-002

Copy

Copied to clipboard

BibTeX EndNote RIS

Published Online: 2012-04-24

Published in Print: 2012-04

You are currently not able to access this content.

Articles in the same Issue

Masthead
On additivity and affinity coefficients of discrete functions
The automorphism groups of certain codes
On the distribution of absolute values of the trigonometric sum
On multiple trigonometric sums of mixed type
Synthesis of easily testable circuits over the basis {&, ∨, ⁻} for systems of Boolean functions
Estimation of the number of maximal extensions in a random graph
The asymptotic normality of the number of congruent cycles in a random permutation
An analogue of the generalised allocation scheme: limit theorems for the number of cells containing a given number of particles

Search journal Search the content of this journal

https://doi.org/10.1515/dma-2012-002

Articles in the same Issue

Masthead
On additivity and affinity coefficients of discrete functions
The automorphism groups of certain codes
On the distribution of absolute values of the trigonometric sum
On multiple trigonometric sums of mixed type
Synthesis of easily testable circuits over the basis {&, ∨, ⁻} for systems of Boolean functions
Estimation of the number of maximal extensions in a random graph
The asymptotic normality of the number of congruent cycles in a random permutation
An analogue of the generalised allocation scheme: limit theorems for the number of cells containing a given number of particles