A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is
For real-time wireless communications, short forward error-correcting (FEC) codes are indispensable due to the strict delay requirement. In this paper we study the performance of short FEC codes. Reed-Solomon (RS) codes and concatenated zigzag (CZ) codes are chosen as representatives of classical algebraic codes and modern simple iterative decodable codes, respectively. Additionally, we use random binary linear codes as a baseline reference for comparison. Our main results (demonstrated by bothdoi:10.1109/icccn.2007.4317850 dblp:conf/icccn/TongLKBP07 fatcat:qa4r74qqg5ftrljzoddg7wxgue