We discuss a secure wireless communication scheme, focusing on designing two major components: the key generation and the coding scheme. To achieve high key matching rate, we propose a feed-forward and feed-back quantization. The proposed scheme offers 1 dB improvement over the best known schemes. We also propose a universal quantization scheme with feedforward/feed-back and show that its perfo...

Faculty of Electrical Engineering, Mathematics and Computer Science CAS-MS-2006-02 The concept of Network-on-Chip (NoC) is becoming a main trend in the area of System-on-Chip (SoC) design. In NoC communications the transmission data may have errors raised by noises or technologies. Forward-Error-Correction (FEC) schemes can be used to improve the systems’ reliability by detecting and correcting...

A new aspect for erasure coding is considered, namely, the possibility that some portion of the arriving packets are corrupted in an undetectable fashion. In practice, the corrupted packets may be attributed to a portion of the communication paths that are leading to the receiver and are controlled by an adversary. Alternatively, in case packets are collected from several sources, the corruptio...

The Bitcoin system uses a fully replicated data storage mechanism in which each node keeps full copy of the blockchain. As number nodes increases and transactions get more complex, space are needed to store block data. scalability has become bottleneck, limiting practical application This paper proposes scheme, called RESS, integrate erasure coding technology into blockchain encode multiple blo...

Two incremental redundancy hybrid ARQ (IR-HARQ) schemes are proposed, analyzed, and compared: one is based on LDPC code ensembles with random transmission assignments, the other is based on recently introduced Raptor codes. A number of important issues, such as rate and power control, Raptor code design, and error rate performance after each transmission on time varying binary-input, symmetrico...

Reliable wireless broadcast with asynchronous data access based on fountain coding is investigated. We review the traditional problem formalisation for fountain codes operating on erasure channels, and we generalise the problem formalisation to more general channels. We introduce a novel type of rateless codes based on the Turbo Principle: the Turbo-Fountain. The Turbo-Fountain is able to consi...

Dedicated short range communication (DSRC) relies on secure distribution to vehicles of a certificate revocation list (CRL) for enabling security protocols. CRL distribution utilizing vehicle-to-vehicle (V2V) communications is preferred to an infrastructure-only approach. One approach to V2V CRL distribution, using rateless coding at the source and forwarding at vehicle relays is vulnerable to ...

Near-Capacity Fixed-Rate and Rateless Channel Code Constructions

Although cooperative communication has been proposed at the physical layer to address multi-path fading effects, how physical layer gains with cooperative communication can translate to tangible performance benefits in end-to-end flows remains to be an open problem. This paper represents one step forward towards a deeper understanding of the interplay between end-to-end throughput and physical ...