New optimal constructions of conflict-avoiding codes of odd length and weight 3

DOI10.1007/S10623-013-9827-2MaRDI QIDQ404933zbMATH OpenOpenAlexFDO

Authors Chun-e Zhao, Wen-Ping Ma, Dong-Su Shen

Publication date 4 September 2014

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-013-9827-2

zbMATH Keywords

optimal codesconflict-avoiding codesequidifference conflict-avoiding codestight codes

Mathematics Subject Classification ID

Cryptography (94A60) Linear codes (general theory) (94B05) Combinatorial codes (94B25)

Recommendations

• scientific article; zbMATH DE number 6500353
• Optimal equi-difference conflict-avoiding codes of odd length and weight three
• Optimal conflict-avoiding codes of odd length and weight three
• Constant Weight Conflict-Avoiding Codes
• Optimal equi-difference conflict-avoiding codes of weight four

Cites work

• scientific article; zbMATH DE number 3867218 (Why is no real title available?)
• A General Upper Bound on the Size of Constant-Weight Conflict-Avoiding Codes
• 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
• On Conflict-Avoiding Codes of Length $n=4m$ for Three Active Users
• Optimal Conflict-Avoiding Codes of Even Length and Weight 3
• Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3
• Some constructions of conflict-avoiding codes
• The collision channel without feedback

Cited in

(16)

• Explicit constructions of optimal conflict-avoiding codes
• Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3
• Optimal Conflict-Avoiding Codes of Even Length and Weight 3
• Optimal 2-D \((n\times m,3,2,1)\)-optical orthogonal codes and related equi-difference conflict avoiding codes
• Optimal strongly conflict-avoiding codes of even length and weight three
• Optimal equi-difference conflict-avoiding codes of odd length and weight three
• Optimal conflict-avoiding codes of odd length and weight three
• Constant Weight Conflict-Avoiding Codes
• On Conflict-Avoiding Codes of Length $n=4m$ for Three Active Users
• Optimal equi-difference conflict-avoiding codes of weight four
• 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?)
• Weighted maximum matchings and optimal equi-difference conflict-avoiding codes
• Optimal conflict-avoiding codes for three, four and five active users
• A new series of optimal tight conflict-avoiding codes of weight 3
• Certain diagonal equations and conflict-avoiding codes of prime lengths

This page was built for publication: New optimal constructions of conflict-avoiding codes of odd length and weight 3

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