Optimal equi-difference conflict-avoiding codes of weight four
From MaRDI portal
Publication:256588
DOI10.1007/s10623-014-0030-xzbMath1333.94070OpenAlexW1969451050MaRDI QIDQ256588
Masakazu Jimbo, Miwako Mishima, Yiling Lin
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
Paths and cycles (05C38) Bounds on codes (94B65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial codes (94B25)
Related Items (1)
Cites Work
- New optimal constructions of conflict-avoiding codes of odd length and weight 3
- Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3
- Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three
- On perfect \(t\)-shift codes in abelian groups
- Optimal conflict-avoiding codes of odd length and weight three
- Optimal equi-difference 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
- Perfect (d,k)-codes capable of correcting single peak-shifts
- Optimal Tight Equi‐Difference Conflict‐Avoiding Codes of Length n = 2k ± 1 and Weight 3
- Optimal Conflict-Avoiding Codes of Even Length and Weight 3
- A General Upper Bound on the Size of Constant-Weight Conflict-Avoiding Codes
This page was built for publication: Optimal equi-difference conflict-avoiding codes of weight four
