Completely separating systems
From MaRDI portal
Publication:1172044
zbMath0499.94031MaRDI QIDQ1172044
Publication date: 1982
Published in: Problems of Information Transmission (Search for Journal in Brave)
binary codesconcatenated codesReed-Solomon codesnoise stabilityantiracinglimits of the parametersnoise-stable state assignment for asynchronous discrete automata
Formal languages and automata (68Q45) Linear codes (general theory) (94B05) Channel models (including quantum) in information and communication theory (94A40)
Related Items (11)
Almost separating and almost secure frameproof codes over \(q\)-ary alphabets ⋮ The fullrank value function ⋮ Separating codes and a new combinatorial search model ⋮ Improved upper bounds for the rate of separating and completely separating codes ⋮ Value functions and two classes of binary codes ⋮ Constructions of almost secure frameproof codes with applications to fingerprinting schemes ⋮ Cover-free codes and separating system codes ⋮ Bounds on the rate of separating codes ⋮ On the construction of \((w,r)\) cover-free codes ⋮ The \(t\)-wise intersection and trellis of relative four-weight codes ⋮ The separation of binary relative three-weight codes and its applications
This page was built for publication: Completely separating systems
