Title :
On conflict-avoiding codes of weight three and odd length
Author :
Shum, Kenneth W.
Author_Institution :
Inst. of Network Coding, Chinese Univ. of Hong Kong, Hong Kong, China
Abstract :
Explicit constructions of optimal conflict-avoiding codes of weight three and even length are recently obtained. For odd length, the construction of optimal conflict-avoiding codes of weight three in general remains open. Previous results by Levenshtein consider the special case of conflict-avoiding codes consisting of equi-difference codewords only. In this paper, we take the non-equi-difference codewords into account, and reduce the problem to hypergraph matching problem. Some new optimal conflict-avoiding codes are presented.
Keywords :
codes; graph theory; pattern matching; protocols; set theory; equidifference codeword; hypergraph matching problem; nonequidifference codeword; odd length; optimal conflict-avoiding code; protocol sequence; Cost accounting; Delay; Electronic mail; Optimal matching; Protocols; Upper bound; Zinc; Conflict-avoiding codes; collision channel without feedback; hypergraph matching; protocol sequences;
Conference_Titel :
Signal Design and its Applications in Communications (IWSDA), 2011 Fifth International Workshop on
Conference_Location :
Guilin
Print_ISBN :
978-1-61284-047-5
DOI :
10.1109/IWSDA.2011.6159407
