3 Johnson-Type Bounds and Applications to List Decoding

Abstract

AbstractThis chapter, as well as the next one, explore the relation between the list decoding radius and minimum distance of a code. Understanding the relation between these parameters is useful for two reasons: (a) for several important families of codes like Reed-Solomon codes, we have precise bounds on the distance, and one can use the relation between list decoding radius and distance to understand the list decoding potential of these codes; and (b) this shows that one approach to construct good list decodable codes is to construct large distance codes, and the latter is a relatively well-studied and better understood problem. Also, historically the most significant algorithmic results on list decoding have been fueled by an attempt to decode codes whose good minimum distance highlighted their good combinatorial list decodability properties.