Different transforms used in binding a secret key to correlated physical-identifier outputs are compared. Decorrelation efficiency is the metric used to determine transforms that give highly-uncorrelated outputs. Scalar quantizers are applied to transform outputs to extract uniformly distributed bit sequences to which secret keys are bound. A set of transforms that perform well in terms of the decorrelation efficiency is applied to ring oscillator (RO) outputs to improve the uniqueness and reliability of extracted bit sequences, to reduce the hardware area and information leakage about the key and RO outputs, and to maximize the secret-key length. Low-complexity error-correction codes are proposed to illustrate two complete key-binding systems with perfect secrecy, and better secret-key and privacy-leakage rates than existing methods. A reference hardware implementation is also provided to demonstrate that the transform-coding approach occupies a small hardware area.

This article describes how to use the IEEEtran class with LaTeX to produce high quality typeset papers that are suitable for submission to the Institute of Electrical and Electronics Engineers. IEEEtran can produce conference, journal and technical note (correspondence) papers with a suitable choice of class options. This document was produced using IEEEtran in journal mode.

A new polar coding scheme for higher order modulation is presented. An encoding method is proposed such that in combination with Gray labeled Amplitude Shift Keying (ASK) the channel input symbols have a desired non-uniform distribution, resulting in a shaping gain at the receiver compared to conventional bit-interleaved coded modulation (BICM). The proposed scheme mainly affects the encoder, and the complexity increase at the receiver is negligible.

Different coding schemes (Turbo, Polar, binary and non-binary LDPC and tail-biting convolutional codes) which can be potentially used in the next generation mobile communication systems for the short message length regime (message length k <; 512) are discussed. Their error correction performances are compared with finite length bounds and the complexities of the corresponding decoders are evaluated in terms of number of basic operations. It is shown that significant performance improvement can be obtained in the short message length regime by replacing the LTE Turbo code with other modern coding schemes, however, at a cost of increased decoder complexity.

Polar codes with dynamically frozen bits are combined with probabilistic amplitude shaping (PAS). At the transmitter, constant composition distribution matching (CCDM) is used to match uniformly distributed input bits to symbols having a desired amplitude distribution. At the receiver, a type check exploits the constant composition properties of CCDM in successive cancellation list (SCL) decoding. For 64 amplitude shift keying (ASK) symbols and a spectral efficiency of 1.5 bits per ASK symbol, polar coded PAS with outer cyclic redundancy check (CRC) codes and SCL decoding with type check outperforms PAS with state-of-the-art LDPC codes by 2dB and performs within 0.8dB of Shannon's sphere packing bound (SPB).