2 papers
cs.IT2011
Upper and Lower Bounds on the Minimum Distance of Expander Codes
Alexey Frolov, Victor Zyablov
The minimum distance of expander codes over GF(q) is studied. A new upper bound on the minimum distance of expander codes is derived. The bound is shown to lie under the Varshamov-…
cs.IT2011
On (Partial) Unit Memory Codes Based on Gabidulin Codes
Antonia Wachter, Vladimir Sidorenko, Martin Bossert +1
(Partial) Unit Memory ((P)UM) codes provide a powerful possibility to construct convolutional codes based on block codes in order to achieve a high decoding performance. In this co…