2016/3/23(五) 14:20 - 張玲華博士(交通大學電信所) - On the maximum Code size subject to distance criterion
Title: 2016/3/23(五) 14:20 - 張玲華博士(交通大學電信所) - On the maximum Code size subject to distance criterion
Topic：On the maximum Code size subject to distance criterion
Date&Time：2016/3/23(五) 14:20
Speaker：張玲華 博士 (交通大學 電信所)
Location：清華大學台達館 R216
Abstract：
An exact information spectrum-type formula for the maximum size of finite length block codes subject to a minimum pairwise distance constraint is presented. This formula can be applied to codes
i) with elements selected from a general alphabet and
ii) under a broad class of (potentially asymmetric) distance measures. We show the largest code size can be fully characterized by the information spectrum of the distance between two independent and identically distributed (i.i.d.) random codewords.
A new family of lower bounds to the maximal code size is thus established, and we show that the Gilbert-Varshamov (GV) for linear and non-linear codes is a member of this family.
We derive the Hamming (upper) bound from an information spectrum based perspective. We also extend our study to the asymptotic regime, where we establish first- and second-order bounds on the code rate subject to a normalized minimum pairwise distance.
Topic：On the maximum Code size subject to distance criterion
Date&Time：2016/3/23(五) 14:20
Speaker：張玲華 博士 (交通大學 電信所)
Location：清華大學台達館 R216
Abstract：
An exact information spectrum-type formula for the maximum size of finite length block codes subject to a minimum pairwise distance constraint is presented. This formula can be applied to codes
i) with elements selected from a general alphabet and
ii) under a broad class of (potentially asymmetric) distance measures. We show the largest code size can be fully characterized by the information spectrum of the distance between two independent and identically distributed (i.i.d.) random codewords.
A new family of lower bounds to the maximal code size is thus established, and we show that the Gilbert-Varshamov (GV) for linear and non-linear codes is a member of this family.
We derive the Hamming (upper) bound from an information spectrum based perspective. We also extend our study to the asymptotic regime, where we establish first- and second-order bounds on the code rate subject to a normalized minimum pairwise distance.