Shigeki Miyake, Jun Muramatsu · 2008
A channel code is constructed using sparse matrices for stationary memoryless channels that do not necessarily have a symmetric property like a binary symmetric channel. It is also shown that the constructed code has the following remarkable properties. 1. Joint source-channel coding: Combining channel code with lossy source code, which is also constructed by sparse matrices, a simpler joint source-channel code can be constructed than that constructed by the ordinary block code. 2. Universal coding: The constructed channel code has a universal property under a specified condition.
Cited by 1
Shigeki Miyake, Jun Muramatsu · 2008
A channel code is constructed using sparse matrices for stationary memoryless channels that do not necessarily have a symmetric property like a binary symmetric channel. It is also shown that the constructed code has the following remarkable properties: 1) Joint source-channel coding: Combining with lossy source code, which is also constructed by sparse matrices, a simpler joint source-channel code can be constructed than that constructed by the ordinary block code. 2) Universal coding: The constructed channel code has a universal property under a specified condition.
Cited by 5
Haibo Lin, Zhong Li, Ruihua Ji et al. · Automated Software Engineering · 2025
Cited by 0
Mat Zali, Saliba · UTPedia (Universiti Teknologi Petronas) · 2009
In digital world, all information is in term of 0 and 1. Even the information such as sound, video, graphic or text is in term of 0 and 1. If the information is transmitting through a noisy channel, there is a risk for error to occur. Error correcting code was invented to solve this problem. For this project, the performance evaluation between Low Density Parity Check (LDPC) and Bode-Chaudhuri-Hocquenghem (BCH) in wireless channel is presented. The Addictive White Gaussian Channel (AWGN) is used to represent the wireless channel. A black and white image was used as the data. Peak Signal to Noise Ratio (PSNR) was used to measure the quality of the reconstructed image. If the PSNR value is between 30 dB and 50 dB, the quality of the output image is considered good. As the PSNR value increases, the quality of output image gets better.
Cited by 0
Michael Gastpar, Bixio Rimoldi, Martin Vetterli · IEEE Transactions on Information Theory · 2003
What makes a source-channel communication system optimal? It is shown that in order to achieve an optimal cost-distortion tradeoff, the source and the channel have to be matched in a probabilistic sense. The match (or lack of it) involves the source distribution, the distortion measure, the channel conditional distribution, and the channel input cost function. Closed-form necessary and sufficient expressions relating the above entities are given. This generalizes both the separation-based approach as well as the two well-known examples of optimal uncoded communication. The condition of probabilistic matching is extended to certain nonergodic and multiuser scenarios. This leads to a result on optimal single-source broadcast communication.
Cited by 552Open access
Nam-Soo Kim, Min-Hyuk Kim, Tae-Doo Park et al. · Han-guk marin enjinieoring hakoeji · 2009
Underwater acoustic communication has multipath error because of reflection by sea-level and sea-bottom. The multipath of underwater channel causes receive signal to make error floor. In this paper, we propose the underwater communication system using various channel coding schemes such as RS coding, convolutional code, turbo code and concatenated code for overcoming the multipath effect in underwater channel. As shown in simulation results, characteristic of multipath error is similar to that of random error. So interleaver has not effect on error correcting. For correcting of error floor by multipath, it is necessary to use strong channel codes like turbo code. Turbo code is one of the iterative codes. And the performance of concatenated codes including RS code has better performance than using singular channel codes.
Cited by 0
Saikat Majumder, Shrish Verma · 2013
In this paper, the problem of transmission of Raptor codes over fading channel is considered. We present in this paper joint decoder architecture for Raptor codes over phase coherent fading channel. The proposed scheme does not require transmission of pilot symbols or extra coded bits for achieving the same BER performance. The receiver uses sum-product algorithm to jointly estimate the channel and decode the Raptor coded symbols. We also compare the performance of the practical decoder architecture proposed in the paper with existing architecture using LDPC codes which uses joint decoding.
Cited by 3
Dajiang Chen, Shaoquan Jiang, Zhiguang Qin · 2015
Message Authentication Code (MAC) is a keyed function f <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">K</sub> such that when Alice, who shares the secret K with Bob, sends f <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">K</sub> (M) to the latter, Bob will be assured of the integrity and authenticity of M. Traditionally, it is assumed that the channel is noiseless. Unfortunately, Maurer showed that in this case an attacker can succeed with probability equation after authenticating ∓ messages, where H(K) is the entropy of K. In this paper, we consider the setting where the channel is noisy. Specifically, Alice and Bob are connected by a discrete memoryless channel (DMC) W <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> and a noiseless but insecure channel. In addition, there is a DMC W <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> between Alice and attacker Oscar. We regard the noisy channel as an expensive resource and define the authentication rate ρ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">auth</sub> as the ratio of message length to the number n of channel W <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> uses. The security of this model depends on the channel coding for f <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">K</sub> (M). A natural coding scheme is to use the secrecy capacity achieving code of Csiszár and Körner. Intuitively, this is also the optimal strategy. However, we propose a coding scheme that achieves a higher ρ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">auth</sub> . Our crucial point is that under a secrecy capacity code, Bob can fully recover f <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">K</sub> (M) while in our model this is not necessary as we only need to detect the existence of the modification. How to detect the malicious modification without recovering f <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">K</sub> (M) is the main contribution of this work. We achieve this through random coding techniques.
Cited by 8
趙志民 · 2004
計畫編號：NSC93-2218-E032-006
Cited by 0
Sangchoon Kim, Jinyoung An · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · 2009
In this paper, the impacts of using multiple transmit antennas under doubly correlated MIMO channels on CDMA uplink code acquisition is studied. The performance of a MIMO code acquisition system is analyzed by considering spatial fading correlations, which depend on antenna spacing and azimuth spread at both MS and BS. The detection performance and mean acquisition time in the presence of spatially correlated MIMO channel are presented on a frequency selective fading channel and compared with the cases of spatial fading decorrelation via numerical evaluation. It is observed that the acquisition performance relies on the degree of spatial fading correlations. In addition, it is surprisingly seen that a MIMO code acquisition system provides worse performance than SIMO.
Cited by 0
Xingli Sun (4775079), Jinjie Yao (9201442), Zhiliang Yang (430375) · Figshare · 2025
Different receiver IF channel or code combinations.
Cited by 0Open access
SMARTech Repository (Georgia Institute of Technology) · 2017
A method for puncturing a low density parity check (LDPC) code that is decoded through a parity check matrix expressed by a factor graph including check nodes and bit nodes connected to the check nodes through edges. The method includes classifying the bit nodes mapped to a parity part of a codeword into hierarchical groups according to their decoding facilities when the bit nodes are punctured, determining puncturing order of the groups, and sequentially performing puncturing on the bit nodes from a bit node belonging to a corresponding group according to the puncturing order of the groups to acquire a codeword with a desired coding rate.
Cited by 0
Richard A. Nielsen · Harvard Dataverse · 2012
Data and code to reproduce the codings for aid project channel of delivery, discussed in the Supporting Information, section 1. Must be opened using the freeware 7zip (http://www.7-zip.org/)
Cited by 0Open access
В. К. Леонтьев, Garib Movsisyan, Zhirayr Margaryan · 2012
Cited by 0
Pengwei Wang, Reihaneh Safavi–Naini · 2014
In the (ρ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">r</sub> , ρ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">w</sub> )-adversarial wiretap (AWTP) channel model of [13], a codeword sent over the communication channel is corrupted by an adversary who observes a fraction ρ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">r</sub> of the codeword, and adds noise to a fraction ρ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">w</sub> of the codeword. The adversary is adaptive and chooses the subsets of observed and corrupted components, arbitrarily. In this paper we give the first efficient construction of a code family that provides perfect secrecy in this model, and achieves the secrecy capacity.
Cited by 9
Yihao Yin, Chunbo Luo, Xitong Pu et al. · IEEE Transactions on Vehicular Technology · 2025
Cited by 0
Ying Huang, Lei Jing, Baoguo Li et al. · International Journal of Future Computer and Communication · 2015
Cited by 0Open access
Pierre-Louis Cayrel, Falko Strenzke, Flexsecure Gmbh · 2015
Abstract. The McEliece and the Niederreiter public key cryptosystems (PKC) are supposed secure in a post quantum world [4] because there is no efficient quantum algorithm for the underlying problems upon which these cryptosystems are built. The CFS, Stern and KKS signature schemes are post-quantum secure because they are based on hard problems of coding theory. The purpose of this article is to describe what kind of attacks have been proposed against code-based constructions and what is missing.
Cited by 0
Jian Deng, Qi Lu, Yu Liu et al. · Progress in Nuclear Energy · 2020
Cited by 24
Januszkiewicz, Giacomo Bacci, Henryk Gierszal et al. · CINECA IRIS Institutial research information system (University of Pisa) · 2010
Cited by 0