The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Øyvind Ytrehus: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Tor Helleseth, Torleiv Kløve, Øyvind Ytrehus
    Generalizations of the Griesmer Bound. [Citation Graph (0, 0)][DBLP]
    Error Control, Cryptology, and Speech Compression, 1993, pp:41-52 [Conf]
  2. Eirik Rosnes, Øyvind Ytrehus
    High Rate Convolutional Codes with Optimal Cycle Weights. [Citation Graph (0, 0)][DBLP]
    IMA Int. Conf., 2003, pp:4-23 [Conf]
  3. Noboru Hamada, Tor Helleseth, Øyvind Ytrehus
    A New Class of Nonbinary Codes Meeting the Griesmer Bound. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:47, n:3, pp:219-226 [Journal]
  4. Noboru Hamada, Tor Helleseth, Øyvind Ytrehus
    On the Construction of [q4 + q2 - q, 5, q4 - q3 + q2 - 2q; q]-Codes Meeting the Griesmer Bound. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1992, v:2, n:3, pp:225-229 [Journal]
  5. Angela I. Barbero, Øyvind Ytrehus
    On the bit oriented trellis structure of run length limited codes on discrete local data dependent channels. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:241, n:1-3, pp:51-63 [Journal]
  6. Eirik Rosnes, Øyvind Ytrehus
    On maximum length convolutional codes under a trellis complexity constraint. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2004, v:20, n:2-3, pp:372-403 [Journal]
  7. Eirik Rosnes, Øyvind Ytrehus
    Improved algorithms for the determination of turbo-code weight distributions. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Communications, 2005, v:53, n:1, pp:20-26 [Journal]
  8. Khaled A. S. Abdel-Ghaffar, Øyvind Ytrehus
    Difference Set Codes: Codes with Squared Euclidean Distance of Six for Partial Response Channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:4, pp:1593-1602 [Journal]
  9. Angela I. Barbero, Øyvind Ytrehus
    Cycle-logical treatment for "Cyclopathic" networks. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:6, pp:2795-2804 [Journal]
  10. Iliya Boukliev, Stefan M. Dodunekov, Tor Helleseth, Øyvind Ytrehus
    On the [162, 8, 80] codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:6, pp:2055-2057 [Journal]
  11. Stefan M. Dodunekov, Tor Helleseth, Nickolai Manev, Øyvind Ytrehus
    New bounds on binary linear codes of dimension eight. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1987, v:33, n:6, pp:917-0 [Journal]
  12. Noboru Hamada, Tor Helleseth, Halvard Martinsen, Øyvind Ytrehus
    There is no ternary [28, 6, 16] code. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:4, pp:1550-1554 [Journal]
  13. Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein, Øyvind Ytrehus
    Bounds on the minimum support weights. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:2, pp:432-440 [Journal]
  14. Tor Helleseth, Torleiv Kløve, Øyvind Ytrehus
    Generalized Hamming weights of linear codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:3, pp:1133-0 [Journal]
  15. Kjell Jørgen Hole, Øyvind Ytrehus
    Improved coding techniques for preceded partial-response channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:2, pp:482-493 [Journal]
  16. M. F. Hole, Øyvind Ytrehus
    Two-step trellis decoding of partial unit memory convolutional codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:324-329 [Journal]
  17. Kjell Jørgen Hole, Øyvind Ytrehus
    Cosets of Convolutional Codes with Least Possible Maximum Zero- and One-Run Lengths. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:1, pp:423-431 [Journal]
  18. Eirik Rosnes, Øyvind Ytrehus
    Sphere-Packing Bounds for Convolutional Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:11, pp:2801-2809 [Journal]
  19. Øyvind Ytrehus
    Binary [18, 11]2 codes do not exist - Nor do [64, 53]2 codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:2, pp:349-0 [Journal]
  20. Øyvind Ytrehus
    Upper bounds on error-correcting runlength-limited block codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:941-0 [Journal]
  21. Øyvind Ytrehus
    Runlength-limited codes for mixed-error channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:6, pp:1577-1585 [Journal]
  22. Øyvind Ytrehus
    On the trellis complexity of certain binary linear block codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:2, pp:559-560 [Journal]
  23. Øyvind Ytrehus, Tor Helleseth
    There is no binary [25, 8, 10] code (corresp.). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:3, pp:695-0 [Journal]
  24. Angela I. Barbero, Øyvind Ytrehus
    An efficient centralized binary multicast network coding algorithm for any cyclic network [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  25. Eirik Rosnes, Øyvind Ytrehus
    Turbo Decoding on the Binary Erasure Channel: Finite-Length Analysis and Turbo Stopping Sets [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  26. Noboru Hamada, Tor Helleseth, Øyvind Ytrehus
    Characterization of {2(q+1)+2, 2;t, q}-minihypers in PG(t, q) (t>=3, qepsilon{3, 4}). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:115, n:1-3, pp:175-185 [Journal]

  27. Facts of LIFE. [Citation Graph (, )][DBLP]


  28. Coding for a Bit-Shift Channel with Applications to Inductively Coupled Channels. [Citation Graph (, )][DBLP]


  29. Communication on Inductively Coupled Channels: Overview and Challenges. [Citation Graph (, )][DBLP]


  30. Improved Delay Estimates for a Queueing Model for Random Linear Coding for Unicast [Citation Graph (, )][DBLP]


  31. Preface. [Citation Graph (, )][DBLP]


Search in 0.036secs, Finished in 0.038secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002