Optimal Conflict-avoiding Codes of Even Length and Weight 3
碩士 === 國立交通大學 === 應用數學系所 === 98 === A conflict-avoiding code of length n and weight k is defined as a set C Contains in (Z_2)^n of binary vectors, called codewords, all of Hamming weight k such that the distance of arbitrary cyclic shifts of two distinct codewords in C is at least 2k-2. In this the...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/07715500721594548091 |
| Summary: | 碩士 === 國立交通大學 === 應用數學系所 === 98 === A conflict-avoiding code of length n and weight k is defined as a set C Contains in (Z_2)^n of binary vectors, called codewords, all of Hamming weight k such that the distance of arbitrary cyclic shifts of two distinct codewords in C is at least 2k-2. In this thesis, we obtain direct constructions for optimal conflict-avoiding codes of length
n = 4m where m is odd and weight 3 by using certain types of sequences which are newly constructed. As a consequence (with known results), we have completely settled the problem of constructing optimal con°ict-avoiding codes of even length and weight 3.
|
|---|