Title :
Heuristic algorithms for ordering a linear block code to reduce the number of nodes of the minimal trellis
Author :
Engelhart, Achim ; Maucher, Johannes ; Sidorenko, Vlaclimir
Author_Institution :
Dept. of Inf. Technol., Ulm Univ., Germany
Abstract :
We propose simple heuristic algorithms permuting the code positions of a linear block code to reduce the total number of nodes of the minimal trellis. Obtained results for some codes are presented
Keywords :
binary codes; block codes; computational complexity; linear codes; trellis codes; heuristic algorithms; linear block code; minimal trellis; ordering; permutation; Block codes; Decoding; Encoding; Genetic mutations; Heuristic algorithms; Information technology; Viterbi algorithm;
Conference_Titel :
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location :
Cambridge, MA
Print_ISBN :
0-7803-5000-6
DOI :
10.1109/ISIT.1998.708807
