The average dimension of the hull of cyclic codes. (Q1811111): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: Kanat S. Abdukhalikov / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Kanat S. Abdukhalikov / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Affine and projective planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-self-reciprocal polynomials and potentially large minimum distance BCH codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing automorphism groups of error-correcting codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation group algorithms based on partitions. I: Theory and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4335298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Dimension of the Hull / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the permutation between equivalent linear codes: the support splitting algorithm / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0166-218x(02)00451-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1986971697 / rank
 
Normal rank

Latest revision as of 08:23, 30 July 2024

scientific article
Language Label Description Also known as
English
The average dimension of the hull of cyclic codes.
scientific article

    Statements

    The average dimension of the hull of cyclic codes. (English)
    0 references
    0 references
    10 June 2003
    0 references
    The average dimension \(E_q(n)\) of the hull of linear cyclic codes of a given length \(n\) over a given finite field \(F_q\) is studied, where the hull of a code is its intersection with its dual code. An explicit expression for \(E_q(n)\) is derived. Let \({\mathcal N}_q\) be the set of positive divisors of the integers of the form \(q^i+1\), \(i>0\). Then \(E_q(n)\) is zero if and only if \(n\in {\mathcal N}_q\), and it grows at the same rate as \(n\) when \(n\not\in {\mathcal N}_q\). Moreover, the asymptotic behavior of \(E_q(n)/n\) is studied, and the set of limits of all converging subsequences of the sequence \(E_q(n)/n\), \(n\geq 1\), \((n,q)=1\), is determined.
    0 references
    error-correcting codes
    0 references
    cyclic codes
    0 references
    hull
    0 references

    Identifiers