Øyvind Ytrehus: Selected Publications
Papers on...
Codes for recording channels
- Upper bounds
on error-correcting runlength-limited block codes, IEEE Trans. Inf.
Th., May 1991, pp. 941-945.
- Runlength-limited codes for mixed-error channels, IEEE Trans. Inf.
Th., November 1991, pp. 1577-1585.
- A rate
3/8 (1,3) constrained code with free Hamming distance 3, Technical
report no. 38, Department of informatics, University of Bergen, September
1989. (Nice figures missing)
- Improved coding techniques for precoded partial-response channels (with
K. J. Hole), IEEE Trans. Inf. Th., March 1994, pp. 482-493.
- Trellis
codes for precoded partial response channels: Further improved search techniques,
(with K. J. Hole), Proc. ISITA'94, pp. 475-479, Sydney, Australia, Nov.
20-24, 1994.
- Difference
Set Codes: Codes with Squared Euclidean Distance of Six for Partial Response
Channels (with Khaled A. S. Abdel-Ghaffar), IEEE Transactions on
Information Theory, Volume 44 Number 4, July 1998, pp. 1593-1602.
Support weights (Generalized Hamming weights) and trellis complexity
- Generalized Hamming weights of linear codes (with T. Helleseth and
T. Kløve), IEEE Trans. Inf. Th., May 1992, pp. 1133-1140.
- Bounds on the minimum support weights (with T. Helleseth, T. Kløve
and V. Levenshtein), IEEE Trans. Inf. Th., March 1995, pp. 432-440.
- On the
trellis complexity of certain binary linear block codes, IEEE Trans.
Inf. Th., March 1995, pp. 559-560.
Convolutional codes
- Binary Convolutional Codes of High Rate, Manuscript, 1992.
- On Ascetic
Convolutional Codes, Proc. 33rd Allerton Conference on Communication,
Control, and Computing, October 5, 1995.
- Improved coding techniques for precoded partial-response channels (with
K. J. Hole), IEEE Trans. Inf. Th., March 1994, pp. 482-493.
- Two-step trellis decoding of partial unit memory convolutional codes
(with M. F. Hole), IEEE Trans. Inf. Th., January 1997, pp. 324-330.
- Cosets of Convolutional Codes with Least Possible Maximum Zero- and
One-Run Lengths (with K. J. Hole), IEEE Trans. Inf. Th., Volume 44 Number
1, January 1998, pp. 423-431.
- Trellis
codes for precoded partial response channels: Further improved search techniques,
(with K. J. Hole), Proc. ISITA'94, pp. 475-479, Sydney, Australia, Nov.
20-24, 1994.
- Further results
on cosets of convolutional codes with short maximum zero-run lengths,
(with K. J. Hole), Proc. IEEE Int. Symp. Inf. Th. '95, p. 146, Canada,
Sept. 17-22, 1995
- Constructions
and proofs of nonexistence of some convolutional codes, Technical
report no. 60, Department of informatics, University of Bergen, April 1992.
Existence of block codes of specific parameters, and related topics
- New bounds on binary linear codes of dimension eight (with S. M. Dodunekov,
T. Helleseth, and N. Manev), IEEE Trans. Inf. Th., November 1987, pp.
917-919.
- How to find
a [33,8,14] code,(with T. Helleseth) Technical report no. 41, Department
of informatics, University of Bergen, November 1989.
- There is
no binary [25,8,10] code,(with T. Helleseth) IEEE Trans. Inf. Th.,
May 1990, pp. 695-696.
- Binary
[18,11]2 codes do not exist. Nor do [64,53]2 codes., IEEE Trans.
Inf. Th., March 1991, pp. 349-351.
- There are
exactly two nonequivalent [20,5,12;3]-codes,(with N. Hamada and T.
Helleseth) ARS Combinatoria, Vol. 35, 1993, pp. 3-14. (Nice figures
missing)
- The nonexistence
of [51,5,33;3]-codes,(with N. Hamada and T. Helleseth) ARS Combinatoria,
Vol. 35, 1993, pp. 25-32.
- On the construction
of [q^4+q^2-q,5,q^4-q^3+q^2-2q;q]-codes meeting the Griesmer bound,(with
N. Hamada and T. Helleseth) Designs, Codes and Cryptography, 1992, pp.
225-229.
- A new class
of nonbinary codes meeting the Griesmer bound,(with N. Hamada and T.
Helleseth) Discrete Applied Mathematics, vol. 47, 1993, pp. 219-226.(Nice
figures missing)
- Characterization
of {2(q+1)+2,2;t,q}-minihypers in PG(t,q) (t \geq 3, q \in {3,4}),(with
N. Hamada and T. Helleseth) Discrete Mathematics, vol. 115, 1993, pp.
175-185.(Nice figures missing)
- On the [162,8,80]
codes (with I. Boukliev, S. M. Dodunekov, and T. Helleseth), IEEE
Trans. Inf. Th., Volume 43 Number 6, November 1997, pp. 2055-2057.