On pair-separating codes

DOI10.1023/A:1013871300662MaRDI QIDQ1812391zbMATH OpenOpenAlexFDO

Authors Grigory Kabatiansky

Publication date 8 January 2004

Published in Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1013871300662

zbMATH Keywords

linear codetwo-pair-separating codes

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Combinatorial aspects of packing and covering (05B40) Linear codes (general theory) (94B05) Bounds on codes (94B65)

Recommendations

• Bounds on the rate of separating codes
• A note on \(\overline{2} \)-separable codes and \(B_2\) codes
• Dual fail-safe separating systems
• \((2,1)\)-separating systems beyond the probabilistic bound
• LATIN 2004: Theoretical Informatics

Cited in

(9)

• Dual fail-safe separating systems
• Bounds on the rate of separating codes
• A note on \(\overline{2} \)-separable codes and \(B_2\) codes
• scientific article; zbMATH DE number 4162816 (Why is no real title available?)
• Upper Bounds on Separating Codes
• \((2,1)\)-separating systems beyond the probabilistic bound
• Improved upper bounds for the rate of separating and completely separating codes
• Separating codes and a new combinatorial search model
• Inequalities for code pairs

This page was built for publication: On pair-separating codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1812391)