| Presentation | 1997/12/2 High-Rate Constrained Codes Immink Kees A. Schouhamer, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | The construction of high-rate codes is far from obvious, as table look-up for encoding and decoding is an engineering impracticality. The usual approach is to supplement the p source bits with m = q - p bits. Under certain, usually simple, rules the source word is modified in such a way that the modified word plus supplement bits comply with the constraints. The information that certain modifications have been made is carried by the m supplement bits. The receiver, on reception of the word, will undo the modifications. In order to reduce complexity and error propagation, the number of bits affected by a modification should be as small as possible. We will survey some examples of code constructions. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | |
| Paper # | IT97-56 |
| Date of Issue |
| Conference Information | |
| Committee | IT |
|---|---|
| Conference Date | 1997/12/2(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Information Theory (IT) |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | High-Rate Constrained Codes |
| Sub Title (in English) | |
| Keyword(1) | |
| 1st Author's Name | Immink Kees A. Schouhamer |
| 1st Author's Affiliation | Philips Research Laboratories() |
| Date | 1997/12/2 |
| Paper # | IT97-56 |
| Volume (vol) | vol.97 |
| Number (no) | 414 |
| Page | pp.pp.- |
| #Pages | 5 |
| Date of Issue | |