Zaloguj się

Gotowe bibliografie tematyczne / Random Network Codes

Spis treści

Artykuły w czasopismach

Gotowa bibliografia na temat „Random Network Codes”

Autor: Grafiati

Data publikacji: 6 września 2023

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Random Network Codes”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "Random Network Codes"

1

Gabidulin, E. M., N. I. Pilipchuk, and M. Bossert. "Decoding of random network codes." Problems of Information Transmission 46, no. 4 (2010): 300–320. http://dx.doi.org/10.1134/s0032946010040034.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

Chen, Chao, Hongmei Xie, and Baoming Bai. "Layered subspace codes for random network coding." Transactions on Emerging Telecommunications Technologies 26, no. 3 (2013): 461–68. http://dx.doi.org/10.1002/ett.2648.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

Riemensberger, Maximilian, Yalin Sagduyu, Michael Honig, and Wolfgang Utschick. "Training overhead for decoding random linear network codes in wireless networks." IEEE Journal on Selected Areas in Communications 27, no. 5 (2009): 729–37. http://dx.doi.org/10.1109/jsac.2009.090613.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

4

Li, Ye, Jun Zhu, and Zhihua Bao. "Sparse Random Linear Network Coding With Precoded Band Codes." IEEE Communications Letters 21, no. 3 (2017): 480–83. http://dx.doi.org/10.1109/lcomm.2016.2632731.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

5

Wang, Shiheng, Quan Zhou, Siyuan Yang, Chaoyuan Bai, and Heng Liu. "Wireless Communication Strategy with BATS Codes for Butterfly Network." Journal of Physics: Conference Series 2218, no. 1 (2022): 012003. http://dx.doi.org/10.1088/1742-6596/2218/1/012003.

Pełny tekst źródła

Streszczenie:

Abstract In this paper, two transmission schemes for batched sparse(BATS) codes based on a multicast protocol in a butterfly network are studied. For both of the schemes, a source file is first segmented into several packets at the source node, which are then coded with outer coder of the BATS codes to generate potentially unlimited batches. Rather than the linear network, in which the packets are directly transmitted to the next node, the packets will be forwarded to multiple nodes in the butterfly network. All the intermediate nodes which receive the packets recode them with random linear network coding (RLNC). At the destination node receivers, the sink node decodes the packets transmitted from different links. The Scheme I requires the intermediate nodes to recode the packets until all of them are received. On the contrary, the intermidate nodes of Scheme II just recode the packets as soon as receiving them and forward the recoded packets to the next node immediately. The Belief Propagation(BP) decoders of these two schemes are studied and applied to Scheme I and Scheme II respectively. The simulation results show that Scheme I consumed fewer batches than Scheme II, which indicates Scheme I outperforms Scheme II.

Style APA, Harvard, Vancouver, ISO itp.

6

Chen, Siguang, Meng Wu, and Weifeng Lu. "Compressed error and erasure correcting codes via rank-metric codes in random network coding." International Journal of Communication Systems 25, no. 11 (2011): 1398–414. http://dx.doi.org/10.1002/dac.1316.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

7

Nazer, Bobak, and Michael Gastpar. "The case for structured random codes in network capacity theorems." European Transactions on Telecommunications 19, no. 4 (2008): 455–74. http://dx.doi.org/10.1002/ett.1284.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

8

LARASATI, SOLICHAH, and KHOIRUN NI’AMAH. "Sub-Optimal Degree Distribution untuk Prioritas Komunikasi Manusia menggunakan Proyeksi EXIT Chart pada Jaringan Masa Depan." ELKOMIKA: Jurnal Teknik Energi Elektrik, Teknik Telekomunikasi, & Teknik Elektronika 7, no. 3 (2019): 442. http://dx.doi.org/10.26760/elkomika.v7i3.442.

Pełny tekst źródła

Streszczenie:

ABSTRAKPada jaringan masa depan melibatkan komunikasi antara mesin dan manusia. Penelitian ini mengusulkan konsep coding dalam jaringan menggunakan Maximum Distance Separable (MDS) codes. Desain sub-optimal degree distribution untuk memprioritaskan manusia menggunakan proyeksi EXIT Chart. Pada penelitian ini dasar dari skema multiple akses untuk jaringan super-padat menggunakan Coded Random Access (CRA). Usulan model jaringan menggunakan Binary Erasure Channel (BEC). Evaluasi performansi untuk grup manusia dan mesin diukur berdasarkan throughput dan packet-loss-rate dan hasilnya juga dibuktikan menggunakan frequency-flat Rayleigh fading. Sub-optimal degree distribusi yang diusulkan ℎ􁈺𝑥􁈻􀵌􁈼􁉀􀵫8,2􀵯,1􁉁􁈽 dan Λ 􀯠􁈺𝑥􁈻􀵌􁈼􁉀􀵫3,2􀵯,0.2􁈻,􁈺􀵫4,2􀵯,0.8􁈻􁉁􁈽 dengan hasil throughput sebelum fading Th 􀵌0.35 paket/slot dan Tm 􀵌0.32 paket/slot, sedangkan setelah fading Th 􀵌0.34 paket/slot dan Tm 􀵌0.22 paket/slot.Kata kunci : MDS codes, CRA, human, machines, EXIT chart ABSTRACTFuture wireless network involving machines and human communications.This research proposed new concept of network coding based on Maximum Distance Separable (MDS) codes. Designed optimally sub-optimal degree distribution for prioritizing human using projected EXIT chart. This research fundamental multiple access scheme for wireless super-dense network using Coded Random Access (CRA). In this research, proposed scheme under Binary Erasure Channel (BEC) to model a network. We evaluate the performance for human and machines group in terms of throughput and packet-loss-rate, and the result are then verified using frequency-flat Rayleigh fading. We have proposed sub-optimal degree distributions are Λ ℎ􁈺𝑥􁈻􀵌􁈼􁉀􀵫8,2􀵯,1􁉁􁈽 and Λ 􀯠􁈺𝑥􁈻􀵌􁉄􁉀􀵫3,2􀵯,0.2􁈻,􁈺􀵫4,2􀵯,0.8􁈻􁉁􁉅, the resulting throughput Th 􀵌0.35 packet/slot and Tm 􀵌0.32 packet/slot under fading and without fading Th 􀵌0.34 packet/slot and Tm 􀵌0.22 packet/slot.Keywords: MDS codes, CRA, human, machines, EXIT chart

Style APA, Harvard, Vancouver, ISO itp.

9

Wachter-Zeh, Antonia, Markus Stinner, and Vladimir Sidorenko. "Convolutional Codes in Rank Metric With Application to Random Network Coding." IEEE Transactions on Information Theory 61, no. 6 (2015): 3199–213. http://dx.doi.org/10.1109/tit.2015.2424930.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

Xiao, Ming, Muriel Medard, and Tor Aulin. "Cross-Layer Design of Rateless Random Network Codes for Delay Optimization." IEEE Transactions on Communications 59, no. 12 (2011): 3311–22. http://dx.doi.org/10.1109/tcomm.2011.112311.100366.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Więcej źródeł

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!