Name
Abstract | ||
|---|---|---|
The class of all fixed-length statistically synchronizable codes may be completely characterized in several ways. A simple condition for determining statistical syncaronizability is demonstrated. |
Year | DOI | Venue |
|---|---|---|
1980 | 10.1109/TIT.1980.1056266 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
probability,synchronization,block codes,decoding,transmitters,statistics | Discrete mathematics,Synchronization,Computer science,Block code,Communication theory,Automated theorem proving,Coding (social sciences),Linear code,Synchronism | Journal |
Volume | Issue | ISSN |
26 | 6 | 0018-9448 |
Citations | PageRank | References |
13 | 1.13 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| V. Wei | 1 | 23 | 3.79 |
| R. A. Scholtz | 2 | 741 | 103.41 |