The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
In this work, we determine the coset weight spectra of all binary cyclic codes of lengths up to 33, ternary cyclic and negacyclic codes of lengths up to 20 and of some binary linear codes of lengths up to 33 which are distance-optimal, by using some of the algebraic properties of the codes and a computer assisted search. Having these weight spectra the monotony of the function of the undetected error probability after t-error correction P(t)ue (C,p) could be checked with any precision for a linear...
Dedicated to the memory of the late professor Stefan Dodunekov
on the occasion of his 70th anniversary.
We classify up to multiplier equivalence maximal (v, 3, 1) optical
orthogonal codes (OOCs) with v ≤ 61 and maximal (v, 3, 2, 1)
OOCs with v ≤ 99.
There is a one-to-one correspondence between maximal (v, 3, 1) OOCs,
maximal cyclic binary constant weight codes of weight 3 and minimum dis
tance 4, (v, 3; ⌊(v − 1)/6⌋) difference packings, and maximal (v, 3, 1) binary
cyclically permutable constant...
Download Results (CSV)