Intersecting codes and separating codes
From MaRDI portal
Publication:1811095
DOI10.1016/S0166-218X(02)00437-7zbMath1025.94016MaRDI QIDQ1811095
G. Cohnen, Hans Georg Schaathun, Simon N. Litsyn, Sylvia B. Encheva
Publication date: 10 June 2003
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items (10)
The fullrank value function ⋮ Variations on Minimal Linear Codes ⋮ On the intersection of binary linear codes ⋮ A note on (3,1) and (3,2) separating systems and bound for (3,1) separating system ⋮ Value functions and two classes of binary codes ⋮ The \(t\)-wise intersection of relative two-weight codes ⋮ On generalized separating hash families ⋮ The separation of binary relative three-weight codes and its applications ⋮ Yet another variation on minimal linear codes ⋮ Trellis complexity and pseudoredundancy of relative two-weight codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algebraic-geometric codes and asymptotic problems
- On codes with the identifiable parent property
- The shadow theory of modular and unimodular lattices
- Separating systems
- A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents
- Separating Partition Systems and Locally Different Sequences
- Separating and Completely Separating Systems and Linear Codes
- Techniques to Construct (2,1) Separating Systems from Linear Error-Correcting Codes
- Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
- More on (2,2)-separating systems
- Intersecting codes and independent families
This page was built for publication: Intersecting codes and separating codes