Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/123272| Title: | A maximum a-posteriori (MAP) decoding algorithm for variable-length error-correcting codes |
| Other Titles: | Codes and cyphers : cryptography and coding IV |
| Authors: | Buttigieg, Victor Farrell, Patrick G. |
| Keywords: | Error-correcting Codes (Information Theory) Coding theory Algorithms Decoders (Electronics) |
| Issue Date: | 1995 |
| Publisher: | Institute of Mathematics and its Applications. |
| Citation: | Buttigieg, V., & Farrell, P. G. (1995). A maximum a-posteriori (MAP) decoding algorithm for variable-length error-correcting codes. In P. G. Farrell (Ed.), Codes and Cyphers: Cryptography and Coding IV (pp. 103-119.) Essex: Institute of Mathematics and its Applications. |
| Abstract: | A maximum a-posteriori decoding algorithm for variable length error-correcting (VLEC) codes is presented. Unlike earlier decoding algorithms for VLEC codes, this new algorithm explicitly takes advantage of the different codeword lengths. It is shown that a VLEC code may be considered to be a trellis code. The performance of a VLEC code for the twenty-six symbol English source is compared to a standard cascade arrangement consisting of separate source and channel codes. It is shown that a coding gain of between 1-2dB is achieved with the VLEC code. |
| URI: | https://www.um.edu.mt/library/oar/handle/123456789/123272 |
| Appears in Collections: | Scholarly Works - FacICTCCE |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| A_maximum_a-posteriori_(MAP)_decoding_algorithm_for_variable-length_error-correcting_codes(1995).pdf Restricted Access | 536.69 kB | Adobe PDF | View/Open Request a copy |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.