The following pages link to Øyvind Ytrehus (Q221590):
Displaying 41 items.
- Preface to the special issue on the occasion of the 65th birthday of Torleiv Kløve on October 17, 2008 (Q1009040) (← links)
- On the construction of \([q^ 4+q^ 2-q, 5, q^ 4-q^ 3+q^ 2-2q; q]\)-codes meeting the Griesmer bound (Q1200291) (← links)
- A new class of nonbinary codes meeting the Griesmer bound (Q1314334) (← links)
- Characterization of \(\{2(q+1) + 2, 2; t, q\}\)-minihypers in \(PG(t,q) (t\geqslant 3, q\in \{3,4\})\) (Q1801697) (← links)
- On maximum length convolutional codes under a trellis complexity constraint (Q1827577) (← links)
- Solving non-linear Boolean equation systems by variable elimination (Q2032298) (← links)
- Coding for Inductively Coupled Channels (Q2989851) (← links)
- (Q3062117) (← links)
- A Coding-Based Approach to Robust Shortest-Path Routing (Q3460446) (← links)
- There is no binary (25,8,10) code (Q3483221) (← links)
- Communication on Inductively Coupled Channels: Overview and Challenges (Q3540935) (← links)
- (Q3546532) (← links)
- Sphere-Packing Bounds for Convolutional Codes (Q3547565) (← links)
- Turbo Decoding on the Binary Erasure Channel: Finite-Length Analysis and Turbo Stopping Sets (Q3548982) (← links)
- New bounds on binary linear codes of dimension eight (Corresp.) (Q3780992) (← links)
- (Q3838676) (← links)
- Runlength-limited codes for mixed-error channels (Q3987452) (← links)
- Generalized Hamming weights of linear codes (Q4008349) (← links)
- (Q4201552) (← links)
- (Q4201554) (← links)
- Improved coding techniques for preceded partial-response channels (Q4308782) (← links)
- Two-step trellis decoding of partial unit memory convolutional codes (Q4336318) (← links)
- On the [162,8,80] codes (Q4392413) (← links)
- Cosets of convolutional codes with least possible maximum zero- and one-run lengths (Q4392481) (← links)
- (Q4485855) (← links)
- There is no ternary [28, 6, 16] code (Q4503614) (← links)
- (Q4570869) (← links)
- Generalizations of the Griesmer bound (Q4637802) (← links)
- Difference set codes: codes with squared Euclidean distance of six for partial response channels (Q4701132) (← links)
- Bounds on the minimum support weights (Q4838668) (← links)
- On the trellis complexity of certain binary linear block codes (Q4838694) (← links)
- (Q4937086) (← links)
- An Efficient Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices (Q4973982) (← links)
- Addendum to “An Efficient Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices” (Q5272157) (← links)
- Cryptography and Coding (Q5428148) (← links)
- Binary (18,11)2 codes do not exist-Nor do (64,53)2 codes (Q5753880) (← links)
- On the bit oriented trellis structure of run length limited codes on discrete local data dependent channels (Q5951926) (← links)
- Formally unimodular packings for the Gaussian wiretap channel (Q6575585) (← links)
- Secrecy gain of formally unimodular lattices from codes over the integers modulo 4 (Q6576469) (← links)
- Dynamic security aspects of onion routing (Q6595948) (← links)
- On evaluating anonymity of onion routing (Q6618579) (← links)
