( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the Secrecy Gain of Isodual Lattices from Tail-Biting Convolutional Codes.

, , , и . ISTC, стр. 1-5. IEEE, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Öyvind Helgerud

Öyvind Schönberger

 

Другие публикации лиц с тем же именем

On Evaluating Anonymity of Onion Routing., , и . SAC, том 13203 из Lecture Notes in Computer Science, стр. 3-24. Springer, (2021)Determining the equivocation in coded transmission over a noisy channel., , и . ISIT, стр. 1253-1258. IEEE, (2022)Dynamic Security Aspects of Onion Routing., , и . IMACC, том 14421 из Lecture Notes in Computer Science, стр. 243-262. Springer, (2023)On lowering the error floor of bit-interleaved turbo-coded modulation., и . ICC, стр. 717-721. IEEE, (2004)An Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices., и . ISIT, стр. 2936-2940. IEEE, (2007)Formally Unimodular Packings for the Gaussian Wiretap Channel., , и . IEEE Trans. Inf. Theory, 69 (12): 7755-7776 (декабря 2023)High Rate Convolutional Codes with Optimal Cycle Weights., и . IMACC, том 2898 из Lecture Notes in Computer Science, стр. 4-23. Springer, (2003)Nested Construction of $Z_2^L -Linear$ Codes., , , и . ISIT, стр. 2598-2603. IEEE, (2024)Communication on Inductively Coupled Channels: Overview and Challenges.. ICMCTA, том 5228 из Lecture Notes in Computer Science, стр. 186-195. Springer, (2008)On bit-interleaved turbo-coded modulation with low error floors., и . ISIT, стр. 52. IEEE, (2004)