scientific article; zbMATH DE number 1498833
It is known that if a doubly-even self-dual \([24t+8s,12t+4s,d]\) code exists, \(s=0,1,2\), then the minimal distance \(d\) is at most \(4t+4\). Previously, it was shown that, for singly-even self-dual \([n,n/2,d]\) codes, \(d\leq 2\lfloor (n+6)/10\rfloor \) except for \(n=2,12,22,32\). \textit{E.~M.~Rains} [IEEE Trans. Inf. Theory 44, No. 1, 134-139 (1998; Zbl 1053.94582)] showed that if a singly-even self-dual \([24t+2l,12t+l,d]\) code exists, then \(d\leq 4t+4\) for \(0\leq l<11\) and \(d\leq 4t+6\) for \(l=11.\) In the article under review, it is proven that if a singly-even self-dual \([24t+8,12t+4,d]\) code exists with a vector of weight 4 in its shadow, \(t\) even, and \(C_{5t}^t\) odd, then \(d\leq 4t+2\). For the entire collection see [Zbl 0918.00043].
- On the minimal weight of some singly-even codes
- On the weight distribution of some minimal codes
- On some classes of codes with a few weights
- A note on the weight distribution of minimal constacyclic codes
- On the minimum weights of binary linear complementary dual codes
- Singly Even Self-Dual Codes With Minimal Shadow
- The minimum weight of the Grassmann codes C(k,n)
- Some restrictions on weight enumerators of singly even self-dual codes
- Some lower bounds for constant weight codes
- On the next-to-minimal weight of affine Cartesian codes
- Nonexistence of certain singly even self-dual codes with minimal shadow
- Singly even self-dual codes of length \(24k + 10\) and minimum weight \(4k + 2\)
- A new upper bound on the minimal distance of self-dual codes
- scientific article; zbMATH DE number 4074967 (Why is no real title available?)
- On the minimal weight of some singly-even codes
- Some restrictions on weight enumerators of singly even self-dual codes. II
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501024)