Meny

Javascript verkar inte påslaget? - Vissa delar av Lunds universitets webbplats fungerar inte optimalt utan javascript, kontrollera din webbläsares inställningar.
Du är här

Searching for tailbiting codes with large minimum distances

Författare:
Publiceringsår: 2000
Språk: Engelska
Sidor: 341-341
Publikation/Tidskrift/Serie: [Host publication title missing]
Dokumenttyp: Konferensbidrag

Sammanfattning

Tailbiting trellis representations of linear block codes with an arbitrary sectionalization of the time axis are studied. A new lower bound on the maximal state complexity of an arbitrary tailbiting code is derived. The asymptotic behavior of the derived bound is investigated. Some new tailbiting representations for linear block codes of rates R=1/c, c=2,3,4 are presented

Nyckelord

  • Electrical Engineering, Electronic Engineering, Information Engineering

Övriga

2000 International Symposium on Information Theory
Published
  • ISBN: 0-7803-5857-0

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu.se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen