Constructions of intersecting codes

DOI10.1109/18.761275zbMath0958.94027OpenAlexW2154531862MaRDI QIDQ4701375

Sylvia B. Encheva, Gérard D. Cohen

Publication date: 21 November 1999

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.761275

zbMATH Keywords

binary linear intersecting codescodes with high distances

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (7)

The fullrank value function ⋮ A note on (3,1) and (3,2) separating systems and bound for (3,1) separating system ⋮ The \(t\)-wise intersection of relative two-weight codes ⋮ The \(t\)-wise intersection and trellis of relative four-weight codes ⋮ On relative constant-weight codes ⋮ On the constructions of highly nonlinear zigzag functions and unbiased functions ⋮ Trellis complexity and pseudoredundancy of relative two-weight codes

This page was built for publication: Constructions of intersecting codes