Throughput analysis of statistically synchronizable cyclic codes(Conference Paper)
Retrieving additional authors...
- aMobtel, Beograd, Bulevar Nikole Tesle, 11000 Beograd, Serbia
- bFaculty of Technical Sciences, University of Novi Sad, Fruškogorska 11, 21000 Novi Sad, Serbia
Retrieving additional affiliations...
Abstract
A minimal trellis decoding procedure, with rearanreceiver end, makes cyclic codes syllable for statistical synchronisation. Algorithms are compared, using \a perssentage of lost data as a criterion. © 2004 IEEE.
Indexed keywords
| Engineering controlled terms: | AlgorithmsBit error rateCommunication systemsComputer simulationDecodingError analysisFailure analysisMatrix algebraProbabilityStatistical methodsSynchronizationTrellis codes |
|---|---|
| Engineering uncontrolled terms | Forward error corrections (FEC)Hamming distancesKronecker's symbolsStatistically synchronizable cyclic codes |
| Engineering main heading: | Codes (symbols) |
- ISBN: 078038556X;978-078038556-6
- Source Type: Conference Proceeding
- Original language: English
- DOI: 10.1109/tic.2004.1409514
- Document Type: Conference Paper
- Sponsors: IEEE Computer Society,Union Radio-Sciencifique Internationale, URSI,University of Tsukuba,Zdruzenie Jozefa Murgasa pre Podporu Cinnosti IEEE na Slovensku
- Publisher: Institute of Electrical and Electronics Engineers Inc.
Stojanovic, J.; Mobtel, Beograd, Bulevar Nikole Tesle, Serbia
© Copyright 2020 Elsevier B.V., All rights reserved.
Cited by 0 documents
{"topic":{"name":"Packet Transmission; Complex Networks; Signal-to-Noise Ratio","id":59663,"uri":"Topic/59663","prominencePercentile":42.61431,"prominencePercentileString":"42.614","overallScholarlyOutput":0},"dig":"380b5d994f4ac1e2decab561ed671eee244abe29f6c932897417d43538d021ac"}