Beomseok Nam, Henrique Andrade, et al.
ACM/IEEE SC 2006
Paper
Some Convolutional Codes Whose Free Distances are Maximal
Abstract
The free distance of a convolutional code of rate 1/n is bounded by n times the constraint length of its encoder. Two classes of convolutional codes whose free distances meet this bound are studied. A technique of constructing convolutional codes that meet this bound for all sufficiently large n is also given. © 1989 IEEE
Related
Conference paper
FPGA-based coprocessor for text string extraction
N.K. Ratha, A.K. Jain, et al.
Workshop CAMP 2000
S. Sattanathan, N.C. Narendra, et al.
CONTEXT 2005
Israel Cidon, Leonidas Georgiadis, et al.
IEEE/ACM Transactions on Networking