| 1. |
- Ekstrand, N., et al.
(författare)
-
Notes on the P-content algorithm
- 1998
-
Ingår i: Proceedings - 1998 IEEE International Symposium on Information Theory, ISIT 1998. - 2157-8095. - 0780350006 - 9780780350007 ; , s. 46-46
-
Konferensbidrag (refereegranskat)abstract
- The P-context algorithm as introduced by Weinberger and Seroussi (see IEEE Trans. Inform. Theory, p.1697-1706, 1996) offers a way to reduce the parameter description costs. This paper concerns a possible improvement of the P-context algorithm. By using weighting techniques an accurate redundancy bound is derived and a possible implementation is proposed.
|
|
| 2. |
- Höst, Stefan, et al.
(författare)
-
Nonequivalent cascaded convolutional codes obtained from equivalent constituent convolutional encoders
- 1998
-
Ingår i: Problems of Information Transmission. - 0032-9460. ; 34:4, s. 291-299, s. 338-338
-
Forskningsöversikt (refereegranskat)abstract
- Cascaded convolutional codes with conventional convolutional codes as constituent codes are powerful and attractive to use in communication systems where very low error probabilities are needed. This paper clearly demonstrates the dramatic effect the replacement of the inner convolutional encoder by an equivalent one could have on the cascaded convolutional code
|
|
| 3. |
|
|
| 4. |
|
|
| 5. |
- Lentmaier, Michael, et al.
(författare)
-
Iterative decoding of generalized low-density parity-check codes
- 1998
-
Ingår i: [Host publication title missing]. - 0780350006
-
Konferensbidrag (refereegranskat)abstract
- A generalization of Gallager's low-density parity-check codes is introduced, where as component codes single-error correcting Hamming codes are used instead of single-error detecting parity-check codes. Low-density (LD) parity-check codes were first introduced by Gallager in 1963. These codes are, in combination with iterative decoding, very promising for achieving low error probabilities at a reasonable cost. Results of computer simulations for long LD codes show, that a performance close to the Shannon capacity limit can be achieved. In this work, we consider a generalized version of low-density parity-check codes, where the decoding procedure can be based on the decoding of Hamming component codes
|
|
| 6. |
- Ståhl, Per, et al.
(författare)
-
New tailbiting encoders
- 1998
-
Ingår i: [Host publication title missing]. - 0780350006 ; , s. 389-389
-
Konferensbidrag (refereegranskat)abstract
- In B tailbiting trellis encoder, the starting state of the encoder is set to the state at which the machine will be at the end of the encoded frame. By this means the probability of decoding error at the end of the frame can be kept low without the addition of termination bits and the consequent rate loss. We report on an extensive search for short and moderatelength convoluticinal encoders for tailbiting trellis representations of bllock codes at rates 1/4, 1/3, 1/2, and 2/3. The short tailbiting representations found are typically as good as the best known block codes.
|
|
