\(\overline{2}\)-separable codes with length 5

DOI10.1016/j.disc.2023.113466zbMath1518.94145OpenAlexW4366714852MaRDI QIDQ6041568

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

orthogonal arrayseparable codecyclic difference matrix

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)

Cites Work

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

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