Please use this identifier to cite or link to this item:
Title: Variable Length error-correcting Codes and Reversible Variable Length Codes: Analysis and Applications
Researcher: Richa Gupta
Guide(s): N. Kalyanasundaram and Bhudev Sharma
Keywords: Analysis and Applications
Error Correcting
Reversible Variable
Upload Date: 3-Jul-2015
University: Jaypee Institute of Information Technology
Completed Date: 05/12/2013
Abstract: A distinctive faculty with which humans are gifted is ‘communication’ – passing information from a source to a destination over a medium. The medium may technically be called ‘channel’. The long-standing issue is to achieve efficient and reliable communication over an unreliable channel. For efficient communication, we use ‘source codes’ which provide a compressed representation of the information. Reliability is obtained by using ‘channel codes’ which protect information from corruptions by adding structured redundancy into it. Communication is always over a channel and the channel, as mentioned above is invariably subjected to disturbances or noise. To minimize the effects of noise, coding is essential. Joint source channel coding (JSCC) is considered as the most promising scheme for communication over wireless channels, in view of its ability to cope with varying channel quantities. The direct source-channel mapping scheme is a good candidate for joint source channel coding. This thesis discusses two types of direct source channel mapped JSCC - Variable Length Error-correcting Codes (VLECs) and Reversible Variable Length Codes (RVLCs). The combinatorial results are important and these provide limitations on search of a code. We have derived an improved combinatorial bound on average codeword length of a subclass of VLECs. Further, we have considered constant length error correcting codes, available in literature, and developed an algorithm to generate VLECs which can be used in real-time applications. Code construction is incomplete without a decoding algorithm. To reduce the complexity of the decoding algorithm, we have developed a modified method of “Maximum Likelihood VLEC Decoding” which converts exponential search into a tabular search, and thereby reduces the computation time.
Appears in Departments:Department of Electronics and Communication Engineering

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File181.07 kBAdobe PDFView/Open
02_table of contents.pdf132.1 kBAdobe PDFView/Open
03_declaration & certificate.pdf98.24 kBAdobe PDFView/Open
04_abstract.pdf99.76 kBAdobe PDFView/Open
05_acknowledgement.pdf99 kBAdobe PDFView/Open
06_list of acronyms & abbreviationsl.pdf97.51 kBAdobe PDFView/Open
07_list of figures & tables.pdf174.46 kBAdobe PDFView/Open
08_chapter1.pdf286.13 kBAdobe PDFView/Open
09_chapter2.pdf306.19 kBAdobe PDFView/Open
10_chapter3.pdf323.74 kBAdobe PDFView/Open
11_chapter4.pdf374.97 kBAdobe PDFView/Open
12_chapter5.pdf655.05 kBAdobe PDFView/Open
13_chapter6l.pdf102.19 kBAdobe PDFView/Open
14_references.pdf174 kBAdobe PDFView/Open
15_appendix.pdf1.54 MBAdobe PDFView/Open
16_list of publications.pdf99.38 kBAdobe PDFView/Open
17_synopsis.pdf193.97 kBAdobe PDFView/Open
Show full item record

Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).

Altmetric Badge: