Information theory and coding
Previous year question paper with solutions for Information theory and coding
Our website provides solved previous year question paper for Information theory and coding . Doing preparation from the previous year question paper helps you to get good marks in exams. From our ITC question paper bank, students can download solved previous year question paper. The solutions to these previous year question paper are very easy to understand.
These Questions are downloaded from www.brpaper.com You can also download previous years question papers of 10th and 12th (PSEB & CBSE), B-Tech, Diploma, BBA, BCA, MBA, MCA, M-Tech, PGDCA, B-Com, BSc-IT, MSC-IT.
Print this page
- Derive the expression for an amount of information for single message and multiple messages.
- Show that H(x,y) = H(x/y)+H(y).
- Explain Shannon’s second fundamental theorem on coding for memory less noise channels
- Show that for a discrete channel I(x,y) >= 0.
- Consider the binary block code C composed of the following four code words : C = {(00100), (10010), (01001), (11111)}
- What is the number of information bits, K?
- What is the number of parity-check bits, c?
- What is the minimum distance of this code?
- What is the maximum weight for which the detection of all error patterns is guaranteed?
- What is the maximum weight for which the correction of all error patterns is guaranteed?