2-separable codes with length 5

DOI10.1016/J.DISC.2023.113466MaRDI QIDQ6041568zbMATH OpenOpenAlexFDO

Authors Cailin Wen, Jing Jiang

Publication date 31 May 2023

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2023.113466

zbMATH Keywords

cyclic difference matrixorthogonal arrayseparable code

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Combinatorial codes (94B25)

Recommendations

• Asymptotically optimal \(\overline {2}\)-separable codes with length 4
• New bounds on \(\bar{2}\)-separable codes of length 2
• LATIN 2004: Theoretical Informatics
• Bounds and constructions for \(\overline{3}\)-separable codes with length 3
• Strongly separable codes

Cites work

• A note on \(\overline{2} \)-separable codes and \(B_2\) codes
• Asymptotically optimal \(\overline {2}\)-separable codes with length 4
• Constructions of new orthogonal arrays and covering arrays of strength three
• New bounds on \(\bar{2}\)-separable codes of length 2
• New Bounds on Separable Codes for Multimedia Fingerprinting
• On Anti-Collusion Codes and Detection Algorithms for Multimedia Fingerprinting
• Probabilistic Existence Results for Separable Codes
• Separable Codes

Cited in

(7)

• Bounds and constructions for \(\overline {3}\)-strongly separable codes with length 3
• Strongly separable codes
• Bounds and constructions for \(\overline{3}\)-separable codes with length 3
• New bounds on \(\bar{2}\)-separable codes of length 2
• Asymptotically optimal \(\overline {2}\)-separable codes with length 4
• LATIN 2004: Theoretical Informatics
• Constructions of \(\bar{3}\)-separable codes with length 4

This page was built for publication: \(\overline{2}\)-separable codes with length 5

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