نتایج جستجو برای: erasure code

تعداد نتایج: 170515  

2013
YU ZHANG KE XIONG DANDAN LI ZHENGDING QIU

The Measurement/Logging While Drilling (M/LWD) system is a kind of sensors system which is used to help oil/gas drilling field technicians to steer well drilling. In M/LWD, several kinds of sensors are installed into drill string to measure the underground logging data during well drilling operations, and a sink within the drill string collects the logging data from the sensors and then transmi...

1999
Radhakrishna CANCHI Yoshihiko AKAIWA

SUMMARY In order to exploit fully the frequency diversity benefits of multicarrier modulation (MCM), and the very nature of the frequency selective radio channel, we investigate an erasure decoded π/4 QDPSK MCM (ED-MCM) by employing simple Hamming (block) code. We propose the threshold-free criteria, i.e. relative minimum receive power test (RMRPT) and relative maximum decision error test (RMDE...

Journal: :J. UCS 2005
Ravi Sankar Veerubhotla Ashutosh Saxena Ved Prakash Gulati Arun K. Pujari

This work presents two new construction techniques for q-ary Gossip codes from tdesigns and Traceability schemes. These Gossip codes achieve the shortest code length specified in terms of code parameters and can withstand erasures in digital fingerprinting applications. This work presents the construction of embedded Gossip codes for extending an existing Gossip code into a bigger code. It disc...

Journal: :IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 2023

This paper considers error-correction for information in array design, i.e., two-dimensional design such as QR-codes. The error model is multi deletion/substitution/erasure errors. Code construction the errors and an application of code are provided. decoding technique uses error-locator deletion codes.

2016
Lluis Pamies-Juarez Filip Blagojevic Robert Mateescu Cyril Guyot Eyal En Gad Zvonimir Bandic

Large distributed storage systems use erasure codes to reliably store data. Compared to replication, erasure codes are capable of reducing storage overhead. However, repairing lost data in an erasure coded system requires reading from many storage devices and transferring over the network large amounts of data. Theoretically, Minimum Storage Regenerating (MSR) codes can significantly reduce thi...

Journal: :JCP 2014
Lina Wang Wei Tang

LT codes, the first universal erasure-correcting codes, have near-optimal performance over binary erasure channels for any erasure probability, but exhibit high bit error rate and error floor over the noisy channels. This paper investigated the performance of LT codes over the additive white Gaussian noise channels. We designed the systematic LT codes through reconstructing the bipartite graph ...

Journal: :IEEE Transactions on Services Computing 2023

Edge computing, as a new computing paradigm, brings cloud computing’s and storage capacities to network edge for providing low latency services users. The networked servers in specific area constitute edge systems (ESSs), where popular data can be stored serve the users area. novel ESSs raise many opportunities well unprecedented challenges. Most existing studies of focus on replicas sys...

Journal: :Quantum 2021

In order to build a large scale quantum computer, one must be able correct errors extremely fast. We design fast decoding algorithm for topological codes Pauli and erasure combination of both erasure. Our has worst case complexity $O(n \alpha(n))$, where $n$ is the number physical qubits $\alpha$ inverse Ackermann's function, which very slowly growing. For all practical purposes, $\alpha(n) \le...

Journal: :IEEE Trans. Information Theory 1995
John A. Gubner Brian L. Hughes

Abstruct-The random-code capacity region of the multiple-access arbitrarily varying channel subject to both state and input constraints is determined. Consideration of a simple erasure channel shows that the capacity region is not convex in general.

1995
John A. Gubner Brian L. Hughes

| The random-code capacity region of the multiple-access arbitrarily varying channel subject to both state and input constraints is determined. Consideration of a simple erasure channel shows that the capacity region is not convex in general.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید