Nouveau : Traduire du texte avec ChatDico – 172 langues

Dictionnaire français - anglais

canal sans mémoire

memoryless channel

informatique et traitement des données - iate.europa.eu

Nous considérons la transmission d'information par un canal sans mémoire.

We consider streaming data transmission over a discrete memoryless channel.

général - CCMatrix (Wikipedia + CommonCrawl)

▷

Exposants d'erreurs pour (quelques) canaux markoviens, applications à internet... Dans sa plus simple version, le théorème de codage-canal affirme que les possibilités d'un canal sans mémoire sont caractérisées par les probabilités de transition entrée/sortie, et le débit maximal d'une communication fiable est identifié comme la solution d'un problème...

▷

A new approach to random access: reliable communication and reliable collision detection... For random access communication over a discrete-time memoryless channel, it is shown that the achievable rate region of the introduced coding approach equals the Shannon information rate region without a convex hull operation....

général - core.ac.uk - PDF: core.ac.ukinformatique et traitement des données - core.ac.uk - PDF: citeseerx.ist.psu.edu

A new channel coding approach for random 1 access with bursty traffic... For random access communication over a discrete-time memoryless channel using a class of random coding schemes, it is shown that the maximum achievable rate region of the introduced coding approach equals the Shannon information...

PDF: citeseerx.ist.psu.edu

Publications scientifiques

▷

An upper bound on the error induced by saddlepoint approximations - applications to information theory

... Ce résultat est appliqué pour étudier la borne "dependence testing (DT)" et celle du "meta converse (MC)" sur la probabilité d'erreur minimale de décodage d'un canal sans mémoire....

... This upper bound, which is particularly precise in the regime of large deviations is used to study the dependence testing (DT) bound and the meta converse (MC) bound on the decoding error probability (DEP) in point-to-point memoryless channels....

général - core.ac.uk -

▷

On the computation of capacity of discrete memoryless channel An iterative method of computing the capacity of a discrete memoryless channel, whose channel matrix has m row vectors and is of rank t, has been proposed independently by Arimoto (1972) and Blahut (1972)....

général - core.ac.uk -

▷

1 the lowest-possible ber and fer for any discrete memoryless channel with given capacityWe investigate properties of a channel coding scheme leading to the minimum-possible frame error ratio when transmitting over a memoryless channel with rate R> C....

général - core.ac.uk - PDF: citeseerx.ist.psu.edu

▷

1 squeezing the arimoto-blahut algorithm for faster convergenceAbstract—The Arimoto–Blahut algorithm for computing the capacity of a discrete memoryless channel is revisited....

général - core.ac.uk - PDF: citeseerx.ist.psu.edu