A new series of optimal tight conflict-avoiding codes of weight 3

DOI10.1016/J.DISC.2016.12.003MaRDI QIDQ507480zbMATH OpenOpenAlexFDO

Authors Miwako Mishima, Koji Momihara

Publication date 6 February 2017

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

optimal codeconflict-avoiding code (CAC)tight code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• Optimal tight equi-difference conflict-avoiding codes of length \(n = 2^{k} \pm 1\) and weight 3
• Optimal equi-difference conflict-avoiding codes of odd length and weight three
• Explicit constructions of optimal conflict-avoiding codes
• Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3
• New optimal constructions of conflict-avoiding codes of odd length and weight 3

Cites work

• scientific article; zbMATH DE number 3867218 (Why is no real title available?)
• scientific article; zbMATH DE number 47996 (Why is no real title available?)
• A Wieferich prime search up to \(6.7 \times 10^{15}\)
• A class of codes for a T active users out of N multiple-access communication system
• Conflict-avoiding codes and cyclic triple systems
• Constant Weight Conflict-Avoiding Codes
• Constructions of binary constant-weight cyclic codes and cyclically permutable codes
• Constructions of protocol sequences for multiple access collision channel without feedback
• Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three
• New optimal constructions of conflict-avoiding codes of odd length and weight 3
• On Conflict-Avoiding Codes of Length $n=4m$ for Three Active Users
• On perfect \(t\)-shift codes in abelian groups
• Optimal Conflict-Avoiding Codes of Even Length and Weight 3
• Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3
• Optimal conflict-avoiding codes of odd length and weight three
• Optimal equi-difference conflict-avoiding codes of odd length and weight three
• Optimal equi-difference conflict-avoiding codes of weight four
• Optimal tight equi-difference conflict-avoiding codes of length \(n = 2^{k} \pm 1\) and weight 3
• Perfect (d,k)-codes capable of correcting single peak-shifts
• Some constructions of conflict-avoiding codes
• The collision channel without feedback

Cited in

(6)

• Optimal Conflict-Avoiding Codes of Even Length and Weight 3
• Multichannel Conflict-Avoiding Codes of Weights Three and Four
• On Conflict-Avoiding Codes of Length $n=4m$ for Three Active Users
• Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three
• scientific article; zbMATH DE number 6500353 (Why is no real title available?)
• Certain diagonal equations and conflict-avoiding codes of prime lengths

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: A new series of optimal tight conflict-avoiding codes of weight 3

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