Cart (Loading....) | Create Account
Close category search window
 

On structured trellises of some best [n,k,d] codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Farkas, P. ; Fac. of Electr. Eng. & Inf. Technol., Slovak Tech. Univ., Bratislava, Slovakia ; Hoc, R. ; Bali, H.

The paper presents new linear binary block codes, with codeword length, n, number of information symbols in codewords, k, and code distance, d, which reach the upper or lower bounds on maximal code-distance, using the construction of M. Kasahara et al. (see IEEE Trans. on Inform. Theory, vol.IT-22, p.462-8, 1976) for some combination of the mentioned parameters. The paper presents, as well, the structured trellises for these codes, using the construction method presented by P. Farka et al. (see Proc. 5th Int. Symp. on Wireless Personal Multimedia Communications, p.1262-4, 2002). The practical importance for wireless communications is that knowledge of the structured trellis can allow decoding of the corresponding code using different soft (turbo) algorithms. In this way, the set of useful codes for practical applications is broadened to 'best' codes, that would otherwise be difficult to decode using soft algorithms.

Published in:

Mobile Future and Symposium on Trends in Communications, 2003. SympoTIC '03. Joint First Workshop on

Date of Conference:

26-28 Oct. 2003

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.