Optimal Conflict-Avoiding Codes of Even Length and Weight 3

DOI10.1109/TIT.2010.2069270zbMath1366.94665OpenAlexW2114224577MaRDI QIDQ5281226

Yi-Hean Lin, Miwako Mishima, Hung-Lin Fu

Publication date: 27 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2010.2069270

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Combinatorial codes (94B25)

Related Items (14)

Optimal strongly conflict-avoiding codes of even length and weight three ⋮ Optimal equi-difference conflict-avoiding codes of odd length and weight three ⋮ Bounds and Constructions on (v, 4, 3, 2) Optical Orthogonal Codes ⋮ Certain diagonal equations and conflict-avoiding codes of prime lengths ⋮ Optimal 2-D \((n\times m,3,2,1)\)-optical orthogonal codes and related equi-difference 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 ⋮ Optimal conflict-avoiding codes for three, four and five active users ⋮ Optimal conflict-avoiding codes of odd length and weight three ⋮ Optimal Tight Equi‐Difference Conflict‐Avoiding Codes of Length n = 2^k ± 1 and Weight 3 ⋮ Optimal optical orthogonal signature pattern codes with weight three and cross-correlation constraint one ⋮ Partially user-irrepressible sequence sets and conflict-avoiding codes ⋮ Optimal equi-difference conflict-avoiding codes of weight four

This page was built for publication: Optimal Conflict-Avoiding Codes of Even Length and Weight 3