Další varianta zkracování Fireových kódů

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26220%2F08%3APU77301" target="_blank" >RIV/00216305:26220/08:PU77301 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Another variant of reducing Fire's codes

Popis výsledku v původním jazyce

Fire's codes are effective codes that secure data transmission over real channels against error bursts. A serious problem of these codes is in the majority of transmission systems under operation an extreme length of the code combination. It is necessaryto solve the problem of adapting the length of code combination to the properties of transmission systems that are to be used in data transmission. There are several ways of solving this problem. One of them consists in adding before the reduced code combination at the receiver end as many zero bits as were removed from the transmitted code combination. This solution is, however, easy to use in the case of small reductions only. Another possibility consists in recalculating the generating polynomial ofthe code into a new polynomial in keeping with the required degree of reduction. The difficulty of this solution lies exactly in the computation complexity of this calculation. These two methods can, however, be combined. Describing this

Název v anglickém jazyce

Another variant of reducing Fire's codes

Popis výsledku anglicky

Fire's codes are effective codes that secure data transmission over real channels against error bursts. A serious problem of these codes is in the majority of transmission systems under operation an extreme length of the code combination. It is necessaryto solve the problem of adapting the length of code combination to the properties of transmission systems that are to be used in data transmission. There are several ways of solving this problem. One of them consists in adding before the reduced code combination at the receiver end as many zero bits as were removed from the transmitted code combination. This solution is, however, easy to use in the case of small reductions only. Another possibility consists in recalculating the generating polynomial ofthe code into a new polynomial in keeping with the required degree of reduction. The difficulty of this solution lies exactly in the computation complexity of this calculation. These two methods can, however, be combined. Describing this

Druh

D - Stať ve sborníku

CEP obor

BD - Teorie informace

OECD FORD obor

—

Projekt

—

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2008

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Sborník konf.RTT 2008

ISBN

978-80-227-2939-0

ISSN

—

e-ISSN

—

Počet stran výsledku

3

Strana od-do

—

Název nakladatele

Slovak University of Technology in Bratislava

Místo vydání

Bratislava

Místo konání akce

Vyhne, Slovak Republic

Datum konání akce

10. 9. 2008

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—