lect24 - Error Correcting Codes: Combinatorics, Algorithms...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Error Correcting Codes: Combinatorics, Algorithms and Applications (Fall 2007) Lecture 24: Code concatenation October 24, 2007 Lecturer: Atri Rudra Scribe: Yang Wang Recall the following question we have encountered before: Question 0.1. Is there an explicit asymptotically good code? (that is, rate R > 0 and relative distance δ > 0 for small q ). Here, explicit means: (i) polynomial time construction (of some representation of the code), (ii) “super” explicit (like description of RS code). We will answer the question at least in the sense of explicit codes of (i) in this lecture. 1 Code Concatenation Code concatenation was first proposed by Forney[1]. For q 2 , k 1 and Q = q k , consider two codes which we call outer code and inner code: C out : [ Q ] K [ Q ] N , C in : [ q ] k [ q ] n . Note that the alphabet size of C out exactly matches | C in | . Then given m = ( m 1 , . . . , m K ) [ Q ] K , we have the code C out C in : [ q ] kK [ q ] nN defined as C out C in ( m ) = ( C in ( C out ( m ) 1 ) , . . . , C in ( C out ( m ) N )) , where C out ( m ) = ± C out ( m ) 1 , . . . , m ) N ² . This construction is also illustrated in Figure 1. We now look at some properties of a concatenated
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/02/2012 for the course CSE 545 taught by Professor Rudra during the Spring '11 term at SUNY Buffalo.

Page1 / 4

lect24 - Error Correcting Codes: Combinatorics, Algorithms...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online