Adaptive random puncturing based secure block turbo coding

Daghighi, Mohammad Sadegh; Payandeh, Ali; Aref, Mohammad Reza

doi:10.1109/istel.2010.5734027

Cited by 5 publications

(1 citation statement)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The permutations (δ LS , δ P G ) = (0, 0) consequently preserve the base interleavers. Note again, that Q is different for {I 0 , I 1 , I 2 , I 3 } and {I 5 } in Table II and therefore the lexicographic index 48, for example refers to δ LS = (0, 1, 2, 5, 3, 4, 6, 7) for I 0 , while it refers to δ LS = (0, 1,2,3,4,5,6,7,8,9,10,13,11,12,14,15) for I 5 .…”

Section: Case Studymentioning

confidence: 99%

Mitigating Blind Detection Through Protograph Based Interleaving for Turbo Codes

Weithoffer

Klaimi

Nour

2021

MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)

View full text Add to dashboard Cite

The complexity involved to blindly detect the channel code parameters in the case of their imperfect knowledge is generally measured in terms of the minimum number of frames that an eavesdropper needs to observe for successful detection, adding an additional layer of privacy. In this work, starting from a defined almost regular interleaver for Turbo codes, we propose methods to construct a larger set of distinct interleavers that increases the minimum number of observations by a factor equal to the size of the constructed set. Furthermore, the generated sets of interleavers can be described by defining only a small number of parameters and are shown to achieve a comparable error correcting performance to base interleavers. To validate the proposed implementation-friendly method, an application example for information frame sizes K=128 bits and K=512 bits is provided for the construction of two sets of 8192 interleavers, prohibitively increasing detection complexity by state-of-the-art methods.

show abstract