Available identifiers
zbMath Open ytrehus.oyvindMaRDI QIDQ221590
List of research outcomes
| Publication | Date of Publication | Type |
|---|
| Solving non-linear Boolean equation systems by variable elimination | 2021-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4570869 | 2018-07-09 | Paper |
| Generalizations of the Griesmer bound | 2018-04-26 | Paper |
| An Efficient Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices | 2017-08-08 | Paper |
| Addendum to “An Efficient Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices” | 2017-07-12 | Paper |
| Coding for Inductively Coupled Channels | 2017-06-08 | Paper |
| A Coding-Based Approach to Robust Shortest-Path Routing | 2016-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3062117 | 2011-01-03 | Paper |
| Preface to the special issue on the occasion of the 65th birthday of Torleiv Kløve on October 17, 2008 | 2009-03-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3546532 | 2008-12-21 | Paper |
| Sphere-Packing Bounds for Convolutional Codes | 2008-12-21 | Paper |
| Turbo Decoding on the Binary Erasure Channel: Finite-Length Analysis and Turbo Stopping Sets | 2008-12-21 | Paper |
| Communication on Inductively Coupled Channels: Overview and Challenges | 2008-11-25 | Paper |
| Cryptography and Coding | 2007-11-28 | Paper |
| On maximum length convolutional codes under a trellis complexity constraint | 2004-08-06 | Paper |
| On the bit oriented trellis structure of run length limited codes on discrete local data dependent channels | 2002-01-08 | Paper |
| There is no ternary [28, 6, 16 code] | 2000-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4485855 | 2000-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937086 | 2000-02-03 | Paper |
| Difference set codes: codes with squared Euclidean distance of six for partial response channels | 1999-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3838676 | 1998-11-26 | Paper |
| On the [162,8,80 codes] | 1998-06-08 | Paper |
| Cosets of convolutional codes with least possible maximum zero- and one-run lengths | 1998-01-01 | Paper |
| Two-step trellis decoding of partial unit memory convolutional codes | 1997-08-26 | Paper |
| On the trellis complexity of certain binary linear block codes | 1995-12-17 | Paper |
| Bounds on the minimum support weights | 1995-07-12 | Paper |
| Improved coding techniques for preceded partial-response channels | 1995-06-11 | Paper |
| A new class of nonbinary codes meeting the Griesmer bound | 1994-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4201552 | 1993-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4201554 | 1993-08-25 | Paper |
| Characterization of \(\{2(q+1) + 2, 2; t, q\}\)-minihypers in \(PG(t,q) (t\geqslant 3, q\in \{3,4\})\) | 1993-06-20 | Paper |
| On the construction of \([q^ 4+q^ 2-q, 5, q^ 4-q^ 3+q^ 2-2q; q\)-codes meeting the Griesmer bound] | 1993-01-16 | Paper |
| Generalized Hamming weights of linear codes | 1992-09-27 | Paper |
| Runlength-limited codes for mixed-error channels | 1992-06-28 | Paper |
| Binary (18,11)2 codes do not exist-Nor do (64,53)2 codes | 1991-01-01 | Paper |
| There is no binary (25,8,10) code | 1990-01-01 | Paper |
| New bounds on binary linear codes of dimension eight (Corresp.) | 1987-01-01 | Paper |
Research outcomes over time
Doctoral students
No records found.
Known relations from the MaRDI Knowledge Graph
This page was built for person: Øyvind Ytrehus
