Isochronous Data Transmission With Rates Close to Channel Capacity

Simple item page
dc.creatorZhdanov, Alexander
dc.date2007-03-25
dc.date.accessioned2026-07-07T08:17:09Z
dc.date.available2026-07-07T08:17:09Z
dc.descriptionThe existing ARQ schemes (including a hybrid ARQ) have a throughput depending on packet error probability. In this paper we describe a strategy for delay tolerant applications which provide a constant throughput until the algorithm robustness criterion is not failed. The algorithm robustness criterion is applied to find the optimum size of the retransmission block in the assumption of the small changes of coding rate within the rate compatible codes family.
dc.identifierhttps://arxiv.org/abs/cs/0703127
dc.identifierhttp://arxiv.org/abs/cs/0703127
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134026
dc.subjectInformation Theory
dc.titleIsochronous Data Transmission With Rates Close to Channel Capacity
dc.typetext

Files

Collections

arXiv