Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/98667| Title: | On variable-length error-correcting codes |
| Authors: | Buttigieg, Victor Farrell, Patrick G. |
| Keywords: | Error-correcting codes (Information theory) Algorithms Binary system (Mathematics) |
| Issue Date: | 1994 |
| Publisher: | IEEE |
| Citation: | Buttigieg, V., & Farrell, P. G. (1994, June). On variable-length error-correcting codes. In Proceedings of 1994 IEEE International Symposium on Information Theory. 507. |
| Abstract: | A different viewpoint on variable-length error- correcting (VLEC) codes is presented, as compared to that found in the literature [1-4]. Consequently, a maximum likelihood decoding algorithm for binary VLEC codes over the binary symmetric channel (BSC) is derived. It is shown that this algorithm achieves significant coding gain over a-prompt decoding introduced by Hartnett et. al., at the expense of increased complexity. |
| URI: | https://www.um.edu.mt/library/oar/handle/123456789/98667 |
| Appears in Collections: | Scholarly Works - FacICTCCE |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| On_variable-length_error-correcting_codes_1994.pdf Restricted Access | 104.19 kB | Adobe PDF | View/Open Request a copy |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.