Name
Abstract | ||
|---|---|---|
The classification of the very thin codes depends on their degrees. We call the very thin codes of degree 1 the synchronizing codes. By using the synchronizing codes, we are able to localize the position of a coded message through which the decoding of the message passes. Upon this position, the message can be divided into two parts and we can always decode these two parts separately. In this paper, we study the very thin codes of degree n. The combinatoric properties of the synchronizing codes are extended to the codes of degree n ≥ 2, and in particular, we study the properties of codes with degree 2. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1016/S0195-6698(03)00016-7 | Eur. J. Comb. |
Keywords | Field | DocType |
thin code,combinatoric property,combinatorial property,synchronizing code,degree n,message passing | Discrete mathematics,Online codes,Concatenated error correction code,Luby transform code,Block code,Expander code,Raptor code,Reed–Muller code,Linear code,Mathematics | Journal |
Volume | Issue | ISSN |
24 | 3 | 0195-6698 |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Liang Zhang | 1 | 1 | 1.16 |
| Hong-Fen Zheng | 2 | 0 | 0.34 |
| K. P. Shum | 3 | 82 | 11.08 |