The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

How to efficiently find the minimum distance of tailbiting codes

På svenska

Author

Summary, in English

A bidirectional algorithm for computing spectral coefficients of convolutional and tailbiting codes is presented and used to obtain new codes.

Publishing year

2002

Language

English

Pages

259-259

Publication/Series

IEEE International Symposium on Information Theory, 2002. Proceedings.

Document type

Conference paper

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Conference name

IEEE International Symposium on Information Theory (ISIT), 2002

Conference date

2002-06-30 - 2002-07-05

Conference place

Lausanne, Switzerland

Status

Published

ISBN/ISSN/Other

  • ISBN: 0-7803-7501-7