The Art of Error Correcting Coding

Morelos-Zaragoza, Robert

doi:10.1002/0470847824

Cited by 232 publications

(80 citation statements)

References 122 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…We also include the results obtained using a turbo code formed by a parallel concatenation of two recursive systematic convolutional codes with polynomial generators (1, 5/7) 8 , separated by a pseudo-random interleaver of length 1000; alternate puncturing of the parity bits yields a rate of 1 2 [22]. The decoder implements 8 iterations of the MAP algorithm using the max-log approximation [23,Ch. 7].…”

Section: Discussion and Applicationsmentioning

confidence: 99%

Distribution of Max-Log Metrics for QAM-Based BICM in Fading Channels

Szczeciński

Alvarado²,

Feick

2009

IEEE Trans. Commun.

View full text Add to dashboard Cite

Abstract-In this letter we derive closed-form expressions for the probability density functions (PDFs) of the bits' reliability metrics (L-values) in bit-interleaved coded modulation (BICM) transmission over fully-interleaved fading channels. The expressions are valid for the relevant case of quadrature amplitude modulation (QAM) with Gray mapping when the metrics are calculated via the so-called max-log approximation. Using the developed expressions, the performance of coded BICM transmissions is efficiently evaluated, i.e., without resorting to otherwise required two-dimensional numerical integration. The BICM capacity for different fading channels and constellation sizes is also evaluated.

show abstract

Section: Discussion and Applicationsmentioning

confidence: 99%

Distribution of Max-Log Metrics for QAM-Based BICM in Fading Channels

Szczeciński

Alvarado²,

Feick

2009

IEEE Trans. Commun.

View full text Add to dashboard Cite

show abstract

“…We use the BCH code discovered independently by Bose and Ray-Chaudhuri and by Hocquenghem [13]. Let be a finite and non-empty set.…”

Section: Bch Encoding Schemementioning

confidence: 99%

“…Given a codeword c, the key information could be retrieved using BCH decoding algorithms which are described clearly in [13].…”

Section: Bch Encoding Schemementioning

confidence: 99%

Gait authentication on mobile phone using biometric cryptosystem and fuzzy commitment scheme

Hoang

Choi

Nguyen

2015

Int. J. Inf. Secur.

View full text Add to dashboard Cite

Authentication systems using gait captured from inertial sensors have been recently developed to enhance the limitation of existing mechanisms on mobile devices and achieved promising results. However, most these systems employed pattern recognition and machine learning techniques in which biometric templates are stored insecurely, which could leave critical security and user privacy issues. Specifically, a compromise of original gait templates could result in everlasting forfeiture. In this paper, two main results will be presented. Firstly, we propose a novel gait authentication system on mobile devices in which the security and privacy are preserved by employing a fuzzy commitment scheme. Instead of storing original gait templates for user verification like in conventional approaches, we verify the user via a stored key which is biometrically encrypted by gait templates collected from a mobile accelerometer. Secondly, the discriminability of sensor-based gait templates are investigated to determine appropriate parameter values to construct an effective gait-based biometric cryptosystem. The performance of our proposed system is evaluated on the dataset including gait signals of 34 volunteers. We achieved the zero-FAR and the False Rejection Rate of approximately 16.18 % corresponding to the key length, as well as the system security level of 139 bits. The results from our experiment show that accelerometer-based gait could be further investigated to construct a biometric cryptosystem, as effective as other biometric traits such as iris, fingerprint, voice, and signature.

show abstract

“…The nominal rate of R = 1 3 ≈ 0.33 was increased through puncturing according to the recommendation of [30] to obtain R = 0.5, R = 0.75 and R = 40 42 ≈ 0.95. The channel decoder was composed of the maximum a-posteriori (MAP) decoders implemented according to [31,Ch. 8].…”

Section: Numerical Examplesmentioning

confidence: 99%

Mapping Rearrangement for HARQ Based on Low-Order Modulation

Szczeciński

Ceron

Feick

2009

IEEE Trans. Commun.

View full text Add to dashboard Cite

Abstract-In this paper we consider hybrid automatic repeat request transmission based on binary phase shift keying modulation. Our objective is to improve the performance of the retransmissions, keeping at the same time the complexity and the performance of the first transmission unaltered. We conclude that the so-called mapping rearrangement (MR) may considerably improve the performance if multi-dimensional modulation is applied. We evaluate the theoretical limits of bit-interleaved coded modulation with MR, verify the functioning of the practical coding scheme, and propose to improve the performance via iterative detection-decoding (BICM-ID) which brings considerable gains. In particular, for high coding rates, a 4 dB SNR gain over transmission without MR may be achieved.

show abstract

The Art of Error Correcting Coding

Cited by 232 publications

References 122 publications

Distribution of Max-Log Metrics for QAM-Based BICM in Fading Channels

Distribution of Max-Log Metrics for QAM-Based BICM in Fading Channels

Gait authentication on mobile phone using biometric cryptosystem and fuzzy commitment scheme

Mapping Rearrangement for HARQ Based on Low-Order Modulation

Contact Info

Product

Resources

About