On the asymptotic number of inequivalent binary self-dual codes

Authors:
Xiang-dong Hou
Affiliations:
Department of Mathematics, University of South Florida, Tampa, FL 33620, USA
Venue:
Journal of Combinatorial Theory Series A
Year:
2007

Citing 6
Cited 2

The binary self-dual codes of length up to 32: a revised enumeration

Journal of Combinatorial Theory Series A
Almost all self-dual codes are rigid

Journal of Combinatorial Theory Series A
The Asymptotic Number of Binary Codes and Binary Matroids

SIAM Journal on Discrete Mathematics
On the asymptotic number of non-equivalent q-ary linear codes

Journal of Combinatorial Theory Series A
On the asymptotic number of non-equivalent binary linear codes

Finite Fields and Their Applications
On the character of Sn acting on subspaces of Fqn

Finite Fields and Their Applications

Classification of self dual quadratic bent functions

Designs, Codes and Cryptography
Necessary conditions for reversed Dickson polynomials to be permutational

Finite Fields and Their Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let @J"n be the number of inequivalent self-dual codes in F"2^2^n. We prove that lim"n"-"~(2n)!@t2^-^1^2^n^(^n^-^1^)@J"n=1, where @t=@?"j"="1^~(1+2^-^j)~2.38423. Let @D"n be the number of inequivalent doubly even self-dual codes in F"2^8^n. We also prove that lim"n"-"~(8n)!@t2^-^2^n^(^4^n^-^3^)@D"n=1.