On the Complexity of Generating forney's Codes

Spasov, Dejan and Gušev, Marjan (2010) On the Complexity of Generating forney's Codes. In: Proceedings of the Seventh Conference on Informatics and Information Technology. Institute of Informatics, Faculty of Natural Sciences and Mathematics, Ss. Cyril and Methodius University in Skopje, Macedonia, Skopje, Macedonia, pp. 173-176. ISBN 978-9989-668-88-3

[img]
Preview
Text
978-9989-668-88-3_pp173-176.pdf

Download (290kB) | Preview
Official URL: http://ciit.finki.ukim.mk

Abstract

Concatenated codes are code constructions made of two codes called the inner code and the outer code [1]. The outer code is usually asymptotically good code over a large alphabet F q m, like the Reed-Solomon code. If a greedy code is used as an inner code, then, following the terminology from [2], we call these codes Forney's codes. In [2], it is suggested that the best code in Wozencraft's ensemble should be used as an inner code; thus lowering the complexity on finding a good inner code. In this paper we present four greedy algorithms that can be used to produce the inner code. Some of these algorithms have lower time complexity than finding the best code in the Wozencraft's ensemble.

Item Type: Book Section
Subjects: International Conference on Informatics and Information Technologies > Theoretical Aspects of Informatics
Depositing User: Vangel Ajanovski
Date Deposited: 28 Oct 2016 00:15
Last Modified: 28 Oct 2016 00:15
URI: http://eprints.finki.ukim.mk/id/eprint/11080

Actions (login required)

View Item View Item