Optimal conflict-avoiding codes of odd length and weight three

DOI10.1007/S10623-012-9764-5MaRDI QIDQ2248642zbMATH OpenOpenAlexWikidataFDO

Authors Yuan-Hsun Lo, Kenneth W. Shum, Hung-Lin Fu

Publication date 27 June 2014

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

Full work available at URL https://doi.org/10.1007/s10623-012-9764-5

zbMATH Keywords

conflict-avoiding codeoptimal code with weight 3tight equi-difference conflict-avoiding code

Mathematics Subject Classification ID

Combinatorial codes (94B25) Other types of codes (94B60)

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
• New optimal constructions of conflict-avoiding codes of odd length and weight 3
• scientific article; zbMATH DE number 6500353
• Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3

Cites work

• scientific article; zbMATH DE number 3032896 (Why is no real title available?)
• A General Upper Bound on the Size of Constant-Weight Conflict-Avoiding Codes
• 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
• A tight asymptotic bound on the size of constant-weight conflict-avoiding codes
• Conflict-avoiding codes and cyclic triple systems
• Constant Weight Conflict-Avoiding 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 Codes Correcting Asymmetric Errors of Limited Magnitude
• Some constructions of conflict-avoiding codes
• Systematic, Single Limited Magnitude Error Correcting Codes for Flash Memories
• The collision channel without feedback

Cited in

(19)

• Partially user-irrepressible sequence sets and conflict-avoiding codes
• Optimal equi-difference conflict-avoiding codes of weight four
• New optimal constructions of conflict-avoiding codes of odd length and weight 3
• Optimal Conflict-Avoiding Codes of Even Length and Weight 3
• Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three
• Optimal strongly conflict-avoiding codes of even length and weight three
• Classification of optimal conflict-avoiding codes of weights 6 and 7
• Optimal conflict-avoiding codes for three, four and five active users
• Conflict-avoiding codes and cyclic triple systems
• 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
• Some progress on optimal 2-D \((n\times m,3,2,1) \)-optical orthogonal codes
• Optimal 2-D \((n\times m,3,2,1)\)-optical orthogonal codes and related equi-difference conflict avoiding codes
• Constant Weight Conflict-Avoiding Codes
• On Conflict-Avoiding Codes of Length $n=4m$ for Three Active Users
• Weighted maximum matchings and optimal equi-difference conflict-avoiding codes
• A new series of optimal tight conflict-avoiding codes of weight 3
• Certain diagonal equations and conflict-avoiding codes of prime lengths
• Multichannel Conflict-Avoiding Codes of Weights Three and Four

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Optimal conflict-avoiding codes of odd length and weight three

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