Name
Abstract | ||
|---|---|---|
A new uniquely decodable (UD) code pair for the two-user binary adder channel (BAC) is presented. This code pair leads to an improved bound for the zero-error capacity region of such a channel. The highest known rate for a UD code pair for the two-user BAC is thereby improved to$(log_2 240)/6 approx 1.3178$. It is also demonstrated that the problem of finding UD code pairs for the closely related binary XOR channel is in one-to-one correspondence with a certain construction of binary one-error-correcting codes. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1109/TIT.2005.853309 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
code pair,certain construction,binary xor channel,ud code pair,two-user bac,zero-error capacity region,two-user binary adder channel,new bound,binary one-error-correcting code,one-to-one correspondence,highest known rate,binary codes,shannon capacity,channel capacity,error correction code,channel coding,adders,decoding | Discrete mathematics,Combinatorics,Binary symmetric channel,Adder,Computer science,Binary code,Error detection and correction,Serial binary adder,Decoding methods,Channel capacity,Binary number | Journal |
Volume | Issue | ISSN |
51 | 9 | 0018-9448 |
Citations | PageRank | References |
10 | 0.71 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| M. Mattas | 1 | 10 | 0.71 |
| Patric R. J. Östergård | 2 | 92 | 12.09 |