Øyvind Ytrehus

IEEE Trans. Inf. Theory, May, 2024

Nested Construction of $\mathbb{Z}_{2^{L}} \text{-Linear}$ Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

2023

Formally Unimodular Packings for the Gaussian Wiretap Channel.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, December, 2023

Proxy Path Scheduling and Erasure Reconstruction for Low Delay mmWave Communication.

[BibT_eX]

[DOI]

David A. Hayes

David Ros

IEEE Commun. Lett., 2023

Dynamic Security Aspects of Onion Routing.

[BibT_eX]

[DOI]

Alessandro Melloni

Martijn Stam

IACR Cryptol. ePrint Arch., 2023

Construction and Secrecy Gain of Formally Unimodular Lattices in Odd Dimensions.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2023

On the Secrecy Gain of Isodual Lattices from Tail-Biting Convolutional Codes.

[BibT_eX]

[DOI]

Proceedings of the 12th International Symposium on Topics in Coding, 2023

2022

On the Secrecy Gain of Formally Unimodular Construction A4 Lattices.

[BibT_eX]

[DOI]

CoRR, 2022

Preface of special issue on coding theory and applications.

[BibT_eX]

[DOI]

Ángela I. Barbero

Vitaly Skachek

Cryptogr. Commun., 2022

On the Secrecy Gain of Formally Unimodular Construction A4 Lattices.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

Determining the equivocation in coded transmission over a noisy channel.

[BibT_eX]

[DOI]

Joakim Algrøy

Proceedings of the IEEE International Symposium on Information Theory, 2022

2021

The Secrecy Gain of Formally Unimodular Lattices on the Gaussian Wiretap Channel.

[BibT_eX]

[DOI]

CoRR, 2021

Solving non-linear Boolean equation systems by variable elimination.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2021

On Evaluating Anonymity of Onion Routing.

[BibT_eX]

[DOI]

Alessandro Melloni

Martijn Stam

Proceedings of the Selected Areas in Cryptography - 28th International Conference, 2021

Tiling of Constellations.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

2019

LDPC Codes Over the BEC: Bounds and Decoding Algorithms.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2019

Variable Elimination - a Tool for Algebraic Cryptanalysis.

[BibT_eX]

[DOI]

Bjørn Møller Greve

Håvard Raddum

IACR Cryptol. ePrint Arch., 2019

Proceedings of the 11th Asia-Europe Workshop on Concepts in Information Theory.

[BibT_eX]

[DOI]

CoRR, 2019

2018

Rate (n-1)/n Systematic Memory Maximum Distance Separable Convolutional Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

2017

Eliminating Variables in Boolean Equation Systems.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

ML and Near-ML Decoding of LDPC Codes Over the BEC: Bounds and Decoding Algorithms.

[BibT_eX]

[DOI]

CoRR, 2017

Rate $(n-1)/n$ Systematic MDS Convolutional Codes over $GF(2^m)$.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Vendor Malware: Detection Limits and Mitigation.

[BibT_eX]

[DOI]

Computer, 2016

Wrap-around sliding-window near-ML decoding of binary LDPC codes over the BEC.

[BibT_eX]

[DOI]

Proceedings of the 9th International Symposium on Turbo Codes and Iterative Information Processing, 2016

2014

Near-Field Passive RFID Communication: Channel Model and Code Design.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2014

Information exchange for routing protocols.

[BibT_eX]

[DOI]

Proceedings of the 2014 Information Theory and Applications Workshop, 2014

A Coding-Based Approach to Robust Shortest-Path Routing.

[BibT_eX]

[DOI]

Proceedings of the Coding Theory and Applications, 4th International Castle Meeting, 2014

2013

Editorial.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2013

2012

Addendum to "An Efficient Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices".

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Coding for Inductively Coupled Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Error correction on an insertion/deletion channel applying codes from RFID standards.

[BibT_eX]

[DOI]

Proceedings of the 2012 Information Theory and Applications Workshop, 2012

On the power transfer of error-control codes for RFID communications.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011

Constrained codes for passive RFID communication.

[BibT_eX]

[DOI]

Proceedings of the Information Theory and Applications Workshop, 2011

2009

An efficient algorithm to find all small-size stopping sets of low-density parity-check matrices.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

Improved delay estimates for a queueing model for random linear coding for unicast.

[BibT_eX]

[DOI]

Mohammad Ravanbakhsh

Proceedings of the IEEE International Symposium on Information Theory, 2009

Coding for a Bit-Shift Channel with Applications to Inductively Coupled Channels.

[BibT_eX]

[DOI]

Proceedings of the Global Communications Conference, 2009. GLOBECOM 2009, Honolulu, Hawaii, USA, 30 November, 2009

2008

Preface.

[BibT_eX]

[DOI]

Cunsheng Ding

Des. Codes Cryptogr., 2008

Communication on Inductively Coupled Channels: Overview and Challenges.

[BibT_eX]

[DOI]

Proceedings of the Coding Theory and Applications, Second International Castle Meeting, 2008

2007

Turbo Decoding on the Binary Erasure Channel: Finite-Length Analysis and Turbo Stopping Sets.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

An efficient centralized binary multicast network coding algorithm for any cyclic network

[BibT_eX]

[DOI]

CoRR, 2007

An Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

Facts of LIFE.

[BibT_eX]

[DOI]

Proceedings of the 16th International Conference on Computer Communications and Networks, 2007

2006

Cycle-logical treatment for "Cyclopathic" networks.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

On the Design of Bit-Interleaved Turbo-Coded Modulation With Low Error Floors.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2006

Maximum Likelihood Decoding of Codes on the Z-channel.

[BibT_eX]

[DOI]

Proceedings of IEEE International Conference on Communications, 2006

2005

Improved algorithms for the determination of turbo-code weight distributions.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2005

Turbo stopping sets: the uniform interleaver and efficient enumeration.

[BibT_eX]

[DOI]

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Finite-length analysis of turbo decoding on the binary erasure channel.

[BibT_eX]

[DOI]

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

On the construction of good families of rate-compatible punctured turbo codes.

[BibT_eX]

[DOI]

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004

Sphere-Packing Bounds for Convolutional Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

On maximum length convolutional codes under a trellis complexity constraint.

[BibT_eX]

[DOI]

J. Complex., 2004

Enhanced decoding by error detection on a channel with correlated 2-dimensional errors.

[BibT_eX]

[DOI]

Pål Ellingsen

Paul H. Siegel

Proceedings of the 2004 IEEE Information Theory Workshop, 2004

On convolutional codes and sphere packing bounds.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

On bit-interleaved turbo-coded modulation with low error floors.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

On lowering the error floor of bit-interleaved turbo-coded modulation.

[BibT_eX]

[DOI]

Proceedings of IEEE International Conference on Communications, 2004

2003

High Rate Convolutional Codes with Optimal Cycle Weights.

[BibT_eX]

[DOI]

Proceedings of the Cryptography and Coding, 2003

2001

On the bit oriented trellis structure of run length limited codes on discrete local data dependent channels.

[BibT_eX]

[DOI]

Discret. Math., 2001

2000

There is no ternary [28, 6, 16] code.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2000

1998

Cosets of Convolutional Codes with Least Possible Maximum Zero- and One-Run Lengths.

[BibT_eX]

[DOI]

Kjell Jørgen Hole

Khaled A. S. Abdel-Ghaffar

IEEE Trans. Inf. Theory, 1998

Difference Set Codes: Codes with Squared Euclidean Distance of Six for Partial Response Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1998

1997

Two-step trellis decoding of partial unit memory convolutional codes.

[BibT_eX]

[DOI]

M. F. Hole

IEEE Trans. Inf. Theory, 1997

On the [162, 8, 80] codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1997

1995

On the trellis complexity of certain binary linear block codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1995

Bounds on the minimum support weights.

[BibT_eX]

[DOI]

Torleiv Kløve

Vladimir I. Levenshtein

IEEE Trans. Inf. Theory, 1995

1994

Improved coding techniques for preceded partial-response channels.

[BibT_eX]

[DOI]

Kjell Jørgen Hole

IEEE Trans. Inf. Theory, 1994

1993

Characterization of {2(q+1)+2, 2;t, q}-minihypers in PG(t, q) (t>=3, qepsilon{3, 4}).

[BibT_eX]

[DOI]

Noboru Hamada

Discret. Math., 1993

A New Class of Nonbinary Codes Meeting the Griesmer Bound.

[BibT_eX]

[DOI]

Noboru Hamada

Discret. Appl. Math., 1993

Generalizations of the Griesmer Bound.

[BibT_eX]

[DOI]

Torleiv Kløve

Proceedings of the Error Control, Cryptology, and Speech Compression, 1993

1992

Generalized Hamming weights of linear codes.

[BibT_eX]

[DOI]

Torleiv Kløve

IEEE Trans. Inf. Theory, 1992

On the Construction of [q4 + q2 - q, 5, q4 - q3 + q2 - 2q; q]-Codes Meeting the Griesmer Bound.

[BibT_eX]

[DOI]

Noboru Hamada

Des. Codes Cryptogr., 1992

1991

Runlength-limited codes for mixed-error channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1991

Upper bounds on error-correcting runlength-limited block codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1991

Binary [18, 11]2 codes do not exist - Nor do [64, 53]2 codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1991

1990

There is no binary [25, 8, 10] code (corresp.).

[BibT_eX]

[DOI]