Optimal equi-difference conflict-avoiding codes of weight four

DOI10.1007/S10623-014-0030-XMaRDI QIDQ256588zbMATH OpenOpenAlexFDO

Authors Yiling Lin, Miwako Mishima, Masakazu Jimbo

Publication date 9 March 2016

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

Full work available at URL https://doi.org/10.1007/s10623-014-0030-x

zbMATH Keywords

equi-difference conflict-avoiding codesmultiplicative order/suborderoptimal codes

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Paths and cycles (05C38) Combinatorial codes (94B25) Bounds on codes (94B65)

Recommendations

• Weighted maximum matchings and optimal equi-difference conflict-avoiding codes
• 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
• Optimal conflict-avoiding codes of odd length and weight three
• Constant Weight Conflict-Avoiding Codes

Cites work

• A General Upper Bound on the Size of Constant-Weight Conflict-Avoiding Codes
• Constant Weight Conflict-Avoiding Codes
• 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 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

Cited in

(8)

• Optimal tight equi-difference conflict-avoiding codes of length \(n = 2^{k} \pm 1\) and weight 3
• Optimal Conflict-Avoiding Codes of Even Length and Weight 3
• Multichannel Conflict-Avoiding Codes of Weights Three and Four
• Optimal equi-difference conflict-avoiding codes of odd length and weight three
• Constant Weight Conflict-Avoiding Codes
• New optimal constructions of conflict-avoiding codes of odd length and weight 3
• Weighted maximum matchings and optimal equi-difference conflict-avoiding codes
• A new series of optimal tight conflict-avoiding codes of weight 3

This page was built for publication: Optimal equi-difference conflict-avoiding codes of weight four

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