Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

On the comparative complexity of algorithms for constructing the syndrome trellis of a linear block code

From MaRDI portal
Jump to:navigation, search

zbMATH Open0980.94035MaRDI QIDQ1582940FDOQ1582940


Authors: A. V. Trushkin Edit this on Wikidata


Publication date: 13 May 2001

Published in: Problems of Information Transmission (Search for Journal in Brave)





Recommendations

  • On the BCJR trellis for linear block codes
  • Trellis decoding complexity of linear block codes
  • On complexity of trellis structure of linear block codes
  • Bounds on complexity of trellis decoding of linear block codes
  • The trellis complexity of convolutional codes


zbMATH Keywords

complexityfixed linear block code trellisminimal syndrome trellis


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear codes (general theory) (94B05) Combined modulation schemes (including trellis codes) in coding theory (94B12)







This page was built for publication: On the comparative complexity of algorithms for constructing the syndrome trellis of a linear block code

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1582940)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1582940&oldid=13873172"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 1 February 2024, at 02:08. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki