Publications

Books and chapters in books

2007

S. W. Golomb, G. Gong, T. Helleseth and H. Y. Song, (Eds.),
Sequences, Subsequences, and Consequences, International Workshop, SSC 2007, Los Angeles, CA, USA, May 31 - June 2, 2007, Lecture Notes in Computer Science(LNCS) 4893, 2007.

T. Helleseth, P. V. Kumar and Ø. Ytrehus (Eds.),
Proceedings of IEEE International Workshop on Information Theory for Wireless Networks (ITW 2007), IEEE Press 2007, Solstrand, Norway, July 1-6, 2007.

T. Kløve,
Codes for error detection, Singapore: World Scientific 2007, 201 pp. Series on Coding Theory and Cryptology.

2006

T. Helleseth and G. Gong (Eds.),
Sequences and Their Applications - SETA 2006, 4th International Conference, Beijing, China, September 24-28, 2006, Lecture Notes in Computer Science(LNCS) 4086, 2006.

Ø. Ytrehus (Ed.),
International Workshop on Coding and Cryptography (WCC 2005), Bergen, Norway, Mar. 14-18, 2005, Revised Selected Papers, Lecture Notes in Computer Science (LNCS) 3969, 2005.

2005

P. Charpin and Ø. Ytrehus (Eds.),
Proceedings International Workshop on Coding and Cryptography (WCC 2005), Bergen, Norway, Mar. 14-18, 2005.

M. G. Parker, Joint author of NESSIE Security Report - D20, coordinator for chapter on Block Ciphers. To be published as a volume in Lecture Notes in Computer Science, planned 2005. (Publication delayed)

Publications in conference proceedings

2007

S. Babbage, C. Cid, N. Pramstaller, and H. Raddum, An analysis of the Hermes8 stream ciphers,
Proceedings of SASC 2007, Stream Ciphers Revisited, Workshop Record, Bochum, Jan. 31-Feb. 1, 2007, xx-xx.

S. Babbage, C. Cid, N. Pramstaller, and H. Raddum, An analysis of the Hermes8 stream ciphers,
Information Security and Privacy, 12th Australasian Conference, ACISP 2007, Townsville, Australia, July 2-4, 2007,
Lecture Notes in Computer Science, 4586 (2007), 1-10.

Á. Barbero and Ø. Ytrehus, Facts of LIFE,
16th International Conference on Computer Communication and Networks, August 2007, 5 pp.

T.E. Bjorstad, A.W. Dent, and N.P. Smart, Efficient KEMs with partial message recovery,
Cryptography and Coding, 11th IMA International Conference, Cirencester, UK, December 18-20, 2007,
Lecture Notes in Computer Science, 4887 (2007), 233-256.

F. Chiaraluce, M. Baldi, S. Spinsante, T. Kløve, The Probability of Undetected Error for Varshamov-Tenengol'ts Codes,
IEEE International Conference on Communication, IEEE Communications Society (2007) pp. 1119-1124.

P. Charpin, T. Helleseth and V. Zinoviev, Title????,
IEEE 2007 International Symposium on Information Theory, Wiley - IEEE press 2007, pp. xx-xx.

L.E. Danielsen and M.G. Parker, Edge local complementation and equivalence of binary linear codes,
Workshop on Coding and Cryptography 2007, Paris, France, April 16-20, (2007), xx-xx.

T. Helleseth, A. Johansen, and A. Kholosha, Four-valued crosscorrelation between $m$-sequences of different lengths,
Book of Abstract for Symposium on Algebraic Geometry and its Applications, Tahiti, May 7-11, 2007, 1 pp.

T. Helleseth, A. Johansen, and A. Kholosha, $m$-sequences of different lengths with four-valued crosscorrelation,
Pre-Proceedings on Workshop on Sequences, Subsequences and Consequences (SSC'07), Los Angeles, USA, May 31 - June 2, 2007, 44-56.

T. Helleseth and A. Kholosha, On the dual of monomial quadratic p -ary bent functions,
Sequences, Subsequences, and Consequences, International Workshop, SSC 2007, Los Angeles, CA, USA, May 31 - June 2, 2007,
Lecture Notes in Computer Science (LNCS), 4893 (2007), 50-61.

A. Johansen, T. Helleseth, and X. Tang, The correlation distribution of sequences of period $2(2^n-1)$,
Proceedings of Optimal Codes and Related Topics. Fifth International Workshop, White Lagoon, Bulgaria, June 16-22, 2007, xx-xx.

L.H. Netland, Y. Espelid, K- Mughal, A reflection based framework for content validation,
Proc. Internatonal Symposium on Frontiers in Availability, Reliability and Security (FARES 07), Wien, Austria, April 10-13, 2007, xx-xx.

M. Parker and A. Pott, On Boolean functions which are bent and negabent,
Sequences, Subsequences, and Consequences, International Workshop, SSC 2007, Los Angeles, CA, USA, May 31 - June 2, 2007,
Lecture Notes in Computer Science, 4893 (2007), 9-23.

H. Raddum, MRHS equation systems,
Selected Areas in Cryptography, 14th International Workshop, SAC 2007, Ottawa, Canada, August 16-17, 2007,
Lecture Notes in Computer Science (LNCS), 4876 (2007), 232-245.

H. Raddum and I. Semaev, Solving MRHS linear equations,
Workshop on Coding and Cryptography 2007, Paris, France, April 16-20, 2007, 323-332.

S. Rønjom and T. Helleseth, Attacking the filter generator over $GF(2^m)$,
Arithmetic of Finite Fields, First International Workshop, WAIFI 2007, Madrid, Spain, June 21-22, 2007,
Lecture Notes in Computer Science, 4547 (2007), 264-275.

S. Rønjom and T. Helleseth, Attacking the filter generator over $GF(2^m)$,
Proceedings of SASC 2007, Stream Ciphers Revisited, Workshop Record, Bochum, Germany, January 31 - Feb. 1, 2007, 51-62.

S. Rønjom and T. Helleseth, The linear vector space spanned by the nonlinear filter generator,
Sequences, Subsequences, and Consequences, International Workshop, SSC 2007, Los Angeles, CA, USA, May 31 - June 2, 2007,
Lecture Notes in Computer Science, 4893 (2007), 169-183.

S. Rønjom, G. Gong, and T. Helleseth, On attacks on filtering generators using linear subspace structures,
Sequences, Subsequences, and Consequences, International Workshop, SSC 2007, Los Angeles, CA, USA, May 31 - June 2, 2007,
Lecture Notes in Computer Science, 4893 (2007), 204-217.

S. Rønjom, G. Gong, and T. Helleseth, A survey of recent attacks on the filter generator,
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 17th International Symposium, AAECC-17, Bangalore, India, December 16-20, 2007,
Lecture Notes in Computer Science, 4851 (2007), 7-17.

E. Rosnes, On the effects of pseudo-codewords on independent Rayleigh flat fading channels,
Proc. IEEE Information Theory Workshop on Information Theory for Wireless Networks, Solstrand, Norway, July 1-6, 2007, 196-173.

E. Rosnes and Ø. Ytrehus, An algorithm to find all small-size stopping sets of low density parity-check matrices,
Proceedings IEEE Symposium on Information Theory (ISIT), Nice, France, June 24-29, 2007, 196-173.

I. Semaev, On solving sparse algebraic equations over finite fields,
Workshop on Coding and Cryptography 2007, Paris, France, April 16-20, 2007, 361-370.

T. Tjøstheim, T. Peacock and P.Y.A. Ryan, A case study in system-based analysis: The three ballot voting system and pret a voter, presented at VoCom, Portland, USA, July 16-18, 2007.

T. Tjøstheim, T. Peacock and P.Y.A. Ryan, A model for system-based analysis of voting systems,
Proceedings of Fifteenth International Workshop on Security Protocols, Brno, Czech Republic, 18-20 April, 2007, 77-95.

X. Tang, T. Helleseth, L. Hu and W. Jiang, A new family of Gold like sequences,
Sequences, Subsequences, and Consequences, International Workshop, SSC 2007, Los Angeles, CA, USA, May 31 - June 2, 2007,
Lecture Notes in Computer Science, 4893, 2007, 57-64.

R. Yorgova and R. Russeva, On the binary [80,40,16] self-dual codes,
Proceedings of Optimal Codes and Related Topics. Fifth International Workshop, Balchik, Bulgaria (2007), 254-259.

R. Yorgova, On the binary self-dual double-even codes of length 112,
IEEE Informational Theory Workshop, Lake Tahoe, CA, USA, September, 2007, 30-35.

2006

Á. Barbero and Ø. Ytrehus, Heuristic algorithms for small field multicast encoding,
Proceedings of 2006 IEEE Information Theory Workshop, Wiley - IEEE press (2006), 428-432

Á. Barbero and Ø. Ytrehus, Knotwork coding,
Proceedings Information Theory and Applications Workshop, San Diego, CA, Feb. 6-10, 2006. Available online at http://ita.ucsd.edu/workshop06/papers/208.pdf.

Á. Barbero, P. Ellingsen, S. Spinsante and Ø.Ytrehus, Maximum Likelihood Decoding of Codes on the Z-channel,
Proceedings of the International Conference on Communications (ICC), Istanbul: IEEE Communications Society (2006), 1200-1205

L. Bassalygo, S. Dodunekov, T. Helleseth, and V. Zinoviev, On a new $q$-ary combinatorial analog of the binary Grey-Rankin bound and codes meeting this bound,
Proceedings IEEE Information Theory Workshop (ITW 2006), Punta del Este, Uruguay, Mar. 13-17, 2006, 278-282.

T. E. Bjørstad and A. W. Dent, Building better signcryption schemes with tag-KEMs,
Proceedings 9th International Conference on Theory and Practice of Public Key Cryptography (PKC 2006), New York City, NY, Apr. 24-26, 2006,
Lecture Notes in Computer Science (LNCS), 3958 (2006), 491-507.

A. Commeine and I. Semaev, An algorithm to solve the discrete logarithm problem with the number field sieve,
Proceedings 9th International Conference on Theory and Practice of Public Key Cryptography (PKC 2006), New York City, USA, Apr. 24-26 2006,
Lecture Notes in Computer Science (LNCS), 3958 (2006), 174-190.

Y. Espelid, L. H. Netland, K. Mughal, and K. J. Hole, Simplifying clint-server application development with secure reusable components,
Proceedings International Symposium on Secure Software Engineering (ISSSE 06), Washington, DC, Mar. 13-15, 2006.

T. Helleseth, C. J. A. Jansen, and A. Kholosha, Pomaranch - Design and analysis of a family of stream ciphers,
Proceedings SASC 2006 - Stream Ciphers Revisited, Leuven, Belgium, Feb. 2-3, 2006, 13-24.

T. Helleseth, C.J.A. Jansen, S. Khazaei, and A. Kholosha, Security of jump controlled sequence generators for stream ciphers,
Sequences and Their Applications - SETA 2006, 4th International Conference, Beijing, China, September 24-28, 2006,
Lecture Notes in Computer Science (LNCS), 4086 (2006), 141-152.

T. Helleseth, T. Kløve, and V. Levenshtein, A bound for codes with given minimum and maximum distance.
IEEE 2006 International Symposium on Information Theory, Wiley - IEEE press 2006, 292-296

V. Moen, A. N. Klingsheim, K. I.F. Simonsen and K. J. Hole, Vulnerabilities in e-governments,
Proceedings 2nd International Conference on Global E-Security (ICGeS-06), London, England, Apr. 20-22, 2006.

I. Naydenova and T. Kløve, A Bound on q-ary t-EC-AUED Codes and Constructions of Some Optimal Ternary t-EC-AUED Codes,
The 2006 International Symposium on Information Theory and its Applications, Seoul: The Society of Information Theory and its applications (2006), 136-139.

I. Naydenova and T. Kløve, Large proper codes for error detection,
Proceedings of 2006 IEEE Information Theory Workshop, Wiley - IEEE press (2006), 170-174.

L.H. Netland, Y. Espelid and K. Mughal, Security patterns for input validation,
Proc. VikingPloP (Pattern Language of Programs), Helsingør, Denmark, Sept. 28 - Oct. 1, 2006, xx-xx.

E. Rosnes, On the connection between finite graph covers, pseudo-codewords, and linear programming decoding of turbo codes,
Proceedings 4th International Symposium on Turbo Codes \&
Related Topics, Munich, Germany, Apr. 3-7, 2006.

E. Rosnes, Stopping sets for iterative row-column decoding of product codes,
The 2006 International Symposium on Information Theory and its Applications, Seoul: The Society of Information Theory and its applications, (2006), 229-234.

E. Rosnes and O.Y Takeshita, Optimum distance quadratic permutation polynomial-based interleavers for turbo codes,
IEEE 2006 International Symposium on Information Theory, Wiley - IEEE press 2006, 1988-1992.

H. G. Schaathun and G. D. Cohen, Nested codes for constrained memory and for dirty paper,
Proceedings 16th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC-16), Las Vegas, NV, Feb. 20-24, 2006,
Lecture Notes in Computer Science (LNCS), 3857 (2006), 307-316.

R.A. Yorgova, Binary self-dual extremal codes of length 92,
IEEE 2006 International Symposium on Information Theory, Wiley - IEEE press 2006, 1292-1295.

R.A. Yorgova, Constructing self-dual codes using an automorphism group,
IEEE 2006 International Symposium on Information Theory, Wiley - IEEE press 2006, 11-15.

2005

B. Bose and T. Kløve, Sperner's theorem and unidirectional codes,
Proceedings International Workshop on Coding and Cryptography (WCC 2005), Bergen, Norway, Mar. 14-18, 2005, 169-175.

P. Charpin, T. Helleseth, and V. Zinoviev, Coset distribution of triple-error-correcting binary primitive BCH codes,
Proceedings IEEE International Symposium on Information Theory (ISIT 2005), Adelaide, SA, Australia, Sept. 4-9, 2005, 1972-1976.

L. E. Danielsen, C. Riera, and M. G. Parker, Graph equivalence from equivalent quantum states,
Proceedings 20th British Combinatorial Conference (BCC), Durham, UK, July 10-15, 2005.

L. E. Danielsen and M. G. Parker, On the classification of all self-dual additive codes over GF(4) of length up to 12,
Proceedings Optimal Codes and Related Topics, Pamporovo, Bulgaria, June 17-23, 2005, 89-95.

D. V. Duong, G. E. Øien, and K. J. Hole, Adaptive coded modulation with receive antenna diversity and imperfect channel knowledge at receiver and transmitter,
Proceedings 13th European Signal Processing Conference (EUSIPCO-2005), Antalya, Turkey, Sept. 4-8, 2005.

P. Ellingsen, On the possibility of achieving capacity on the Z-channel,
Proceedings International Conference on Software, Telecommunications and Computer Networks (SoftCOM 2005), Split, Croatia, Sept. 15-17, 2005.

I. Gancheva, T. Kløve, Codes for error detection, good or not good,
Proceedings IEEE International Symposium on Information Theory (ISIT 2005), Adelaide, SA, Australia, Sept. 4-9, 2005, 2228-2231.

I. Gancheva and T. Kløve, Constructions of some optimal t-EC-AUED codes,
Proceedings Optimal Codes and Related Topics, Pamporovo, Bulgaria, June 17-23, 2005, 152-156.

I. Gancheva and T. Kløve, Generalized Bose-Lin codes, a class of codes detecting asymmetric errors,
Proceedings Optimal Codes and Related Topics, Pamporovo, Bulgaria, June 17-23, 2005, 157-162.

T. A. Gulliver and M. G. Parker, The multivariate merit factor of a Boolean function,
Proceedings IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, Rotorua, New Zealand, Aug. 29 - Sept. 1, 2005, 52-56.

T. Helleseth and A. Kholosha, New monomial bent functions over the finite fields of odd characteristic,
Proceedings IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, Rotorua, New Zealand, Aug. 29 - Sept. 1, 2005, 66-70.

T. Helleseth, A. Kholosha, and G. J. Ness, On the correlation distribution of the Coulter-Matthews decimation,
Proceedings Optimal Codes and Related Topics, Pamporovo, Bulgaria, June 17-23, 2005, 190-195.

H. Molland and T. Helleseth, A linear weakness in the Klimov-Shamir T-function,
Proceedings IEEE International Symposium on Information Theory (ISIT 2005), Adelaide, SA, Australia, Sept. 4-9, 2005, 1106-1110.

I. Naydenova and T. Kløve, Necessary conditions for codes to be good for error detection,
Abstracts Annual Workshop on Coding Theory and Applications, Bankya, Bulgaria, Dec. 15-18, 2005, p. 24.

C. Riera and M. G. Parker, Spectral interpretations of the interlace polynomial,
Proceedings International Workshop on Coding and Cryptography (WCC 2005), Bergen, Norway, Mar. 14-18, 2005, 248-253.

C. Riera and M. G. Parker, On pivot orbits of Boolean functions,
Proceedings Optimal Codes and Related Topics, Pamporovo, Bulgaria, June 17-23, 2005, 248-253.

E. Rosnes and Ø. Ytrehus, Finite-length analysis of turbo decoding on the binary erasure channel,
Proceedings IEEE International Symposium on Information Theory (ISIT 2005), Adelaide, SA, Australia, Sept. 4-9, 2005, 1246-1250.

E. Rosnes and Ø. Ytrehus, On the construction of good families of rate-compatible punctured turbo codes,
Proceedings IEEE International Symposium on Information Theory (ISIT 2005), Adelaide, SA, Australia, Sept. 4-9, 2005, 602-606.

E. Rosnes and Ø. Ytrehus, Turbo stopping sets: The uniform interleaver and efficient enumeration,
Proceedings IEEE International Symposium on Information Theory (ISIT 2005), Adelaide, SA, Australia, Sept. 4-9, 2005, 1251-1255.

H. G. Schaathun, On watermarking/fingerprinting for copyright protection,
Proceedings Norsk Informatikkonferanse (NIK 2005), Bergen, Norway, Nov. 21-23, 2005.

H. G. Schaathun and M. Fernandez-Munoz, Boneh-Shaw fingerprinting and soft decision decoding,
Proceedings IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, Rotorua, New Zealand, Aug. 29 - Sept. 1, 2005, 177-180.

K. I. F. Simonsen, V. Moen, and K. J. Hole, Attack on Sun's MIDP reference implementation of SSL,
Proceedings 10th Nordic Workshop on Secure IT-systems (Nordsec 2005), Tartu, Estonia, Oct. 20-21, 2005, 96-102.

T. Tjøstheim and V. Moen, Vulnerabilities in online banks,
Proceedings 10th Nordic Workshop on Secure IT-systems (Nordsec 2005), Tartu, Estonia, Oct. 20-21, 2005, 63-70.

R. Yorgova, On the automorphish group of an optimal code of length 56,
Proceedings Optimal Codes and Related Topics, Pamporovo, Bulgaria, June 17-23, 2005, 292-297.

2004

B. Bose and T. Kløve,
On two upper bounds on the size of t-EC-AUED codes,
Proceedings, 2004 IEEE Int. Symposium on Information Theory, Chicago, June 27 - July 4, 2004, p. 482.

P. Charpin, T. Helleseth, and V. Zinoviev,
On binary BCH codes with minimal distance 8 and Kloosterman sums,
Proc. Ninth International Conference in Algebraic and Combinatorial Coding Theory (ACCT'9), Kranevo, Bulgaria, 18-24 June, 2004, pp. 90-94

S. Dodunekov, T. Helleseth, and V. Zinoviev,
On q-ary Grey-Rankin bound and codes meeting this bound,
Proceedings, 2004 IEEE Int. Symposium on Information Theory, Chicago, June 27 - July 4, 2004, p. 528.

O. Jetlund, G. E. Øien, K. J. Hole, and H. Holm,
Spectral Efficiency Bounds for Adaptive Coded Modulation with Outage Probability Constraints and Imperfect Channel Prediction,
Proc. Nordic Radio Symposium 2004, Oulu, Finland, August 2004.

Y.S. Kim, J.W. Jang, J.S. No, and T. Helleseth,
New p-ary bent sequences,
Proceedings, 2004 IEEE Int. Symposium on Information Theory, Chicago, June 27 - July 4, 2004, p. 498.

T. Kløve, P. Oprisan, and B. Bose,
Probability of undetected error for a class of unidirectional error detecting codes,
Proceedings, 2004 IEEE Int. Symposium on Information Theory, Chicago, June 27 - July 4, 2004, p. 481.

E. Rosnes and Ø. Ytrehus,
On Bit-Interleaved Turbo-Coded Modulation with Low Error Floors,
Proceedings, 2004 IEEE Int. Symposium on Information Theory, Chicago, June 27 - July 4, 2004, p. 52.

E. Rosnes and Ø. Ytrehus,
On lowering the error floor of bit-interleaved turbo-coded modulation,
Proceedings IEEE Int. Conf. on Communications (ICC), Paris, France, June 20-24, 2004.

E. Rosnes and Ø. Ytrehus,
On Convolutional Codes and Sphere Packing Bounds,
Proceedings, 2004 IEEE Int. Symposium on Information Theory, Chicago, June 27 - July 4, 2004, p. 458.

H.G. Schaathun,
Fighting Three Pirates with Scattering Codes,
Proceedings, 2004 IEEE Int. Symposium on Information Theory, Chicago, June 27 - July 4, 2004, p. 202.

Toon Segers, Tor Helleseth, Martijn Maas, and John Erik Mathiassen,
Linear Complexity over Fp of Sidel'nikov Sequences,
Proceedings, 2004 IEEE Int. Symposium on Information Theory, Chicago, June 27 - July 4, 2004, p. 123.

2003

R. N. Bjørk, H. Ytre-Hauge, E. Rosnes, and A. Vahlin,
Comparison of TCM + RS coding and turbo codes for spectrally efficient low-delay systems,
Proceedings, Norwegian Symp. on Signal Processing, Bergen, Norway, Oct. 2-4 2003.
J.C. Chang, R.J. Chen, T. Kløve, and S.C. Tsai,
Distance preserving mappings from binary vectors to permutations,
Proceedings, 2003 IEEE Int. Symposium on Information Theory, Yokohama, June 29 - July 4, 2003, p. 14.

G. Cohen and H. G. Schaathun,
New upper bounds on separating codes,
ICT 2003, 10th International Conference on Telecommunications, French Polynesia, Feb 2003, vol. 2, 1290-1293.

G. Cohen and H. G. Schaathun,
New bounds on separating families,
Proc. CCC'03, Yellow Mountains, China (planned for June 2003 but was cancelled), to appear.

T. Helleseth, T. Kløve, and V. Levenshtein,
Bounds on error-correction capability of codes beyond half the minimum distance,
Workshop on Coding and Cryptography 2003, Versailles, France, March 24-28, 2003, 243-251.

T. Helleseth, T. Kløve, and V. Levenshtein,
A coset count that proves that the simplex codes are not optimal for error correction,
Proceedings, 2003 IEEE Information Theory Workshop, Paris, France, March 31-April 4, 2003, 234-237.

T. Helleseth, T. Kløve, and V. Levenshtein,
The simplex codes are not optimal for binary symmetric channels,
Proceedings, 2003 IEEE Int. Symposium on Information Theory, Yokohama, June 29 - July 4, 2003, p. 161.

T. Helleseth, T. Kløve, and V. Levenshtein,
Error-correction capability of binary linear codes,
2003 IEEE Int. Symposium on Information Theory, Proceedings, Yokohama, June 29 - July 4, 2003, p. 463.

T. Helleseth, T. Kløve, and V. Levenshtein,
Non-optimality of even weight codes for error correction,
SoftCom 2003, Adriatics, Oct. 7-10, 2003, pp. 822-826.

Ji-Woong Jang, Young-Sik Kim, Jong-Seon No, and T. Helleseth,
New family of p-ary sequences with optimal correlation property and large linear span,
2003 IEEE Int. Symposium on Information Theory, Proceedings, Yokohama, June 29 - July 4, 2003, p. 405.

O. Jetlund, G. E. Øien, and K. J. Hole,
Adaptive Gallager coded modulation on Rayleigh fading channels: comparison of simulated and theoretical performance,
COST 273 TD (03)-040, presented at 6th Management Committee Meeting of COST Action 273, Towards Mobile Broadband Multimedia Networks,
Barcelona, Spain, Jan. 15-17, 2003.

E. Rosnes,
Upper bound on the minimum average cycle weight of classes of convolutional codes,
Proceedings, 2003 IEEE Int. Symposium on Information Theory, Yokohama, June 29 - July 4, 2003, p. 280.

E. Rosnes and Ø. Ytrehus,
Improved algorithms for high rate turbo code weight distribution calculation,
Proc. ICT 2003, 10th Int. Conference on Telecommunications, Papeete, French Polynesia, Feb 2003, vol. 1, pp. 104-111.

E. Rosnes and Ø. Ytrehus,
Sphere packing bounds for convolutional codes,
Proc. CCC'03, Yellow Mountains, China (planned for June 2003 but was cancelled), to appear.

E. Rosnes and Ø. Ytrehus,
On trellis complexity constrained convolutional codes of maximum length,
Proceedings, 2003 IEEE Int. Symposium on Information Theory, Yokohama, June 29 - July 4, 2003, p. 277.

E. Rosnes and Ø. Ytrehus,
An efficient algorithm for tailbiting turbo code weight distribution calculation,
Proc. 3rd Int. Symposium on Turbo Codes & Related Topics, Brest, France, Sept. 1-5, 2003, pp. 439-442.

2002

W. Chen and T. Kløve,
Weight Hierarchies of Linear Codes Satisfying the Almost Chain Condition,
Proceedings of 2002 IEEE Int. Symposium on Information Theory,
Lausanne, Switzerland, June 30 - July 5, 2002, p. 233.

F. Fu and T. Kløve,
The complement of binary linear codes for error detection,
Proceedings of 2002 IEEE Information Theory Workshop,
Bangalore, India, October 20-25, 2002, p. 187.

T. Helleseth,
Ternary Sequences,
Wiley Encyclopedia of Telecommunications, Editor: J.G.Proakis, Wiley Interscience, 2002.

T. Helleseth and G. Gong,
New Nonbinary Sequences with Ideal Two-Level Autocorrelation Function,
Proceedings of 2002 IEEE Int. Symposium on Information Theory,
Lausanne, Switzerland, June 30 - July 5, 2002, p. 182.

T. Helleseth, S.H. Kim and J.S. No,
Linear Complexity over Fp and Trace Representation of Lempel-Cohn-Eastman Sequences,
Proceedings of 2002 IEEE Int. Symposium on Information Theory,
Lausanne, Switzerland, June 30 - July 5, 2002, p. 180.

K.J. Hole,
Bounds on the average spectral efficiency of adaptive coded modulation,
Telektronikk (special issue on information theory and its applications) 98 (2002) 47-52 (published by Telenor)

K.J. Hole, H. Holm, and G. E. Øien,
Performance analysis of adaptive coded modulation with antenna diversity and feedback delay,
Telektronikk (special issue on wireless future) 98 (2002) 106-113 (published by Telenor).

K. J. Hole and G. E. Øien,
Adaptive coded modulation for wireless OFDM channels: upper bounds on average spectral efficiency and influence of imperfect channel knowledge,
Proc. IEE Conference,
Savoy Place, London, UK, Oct. 24-25, 2002.

O. Jetlund, G. E. Øien, K. J. Hole, V. Markhus, and B. Myhre,
Rate-adaptive coding and modulation with LDPC component codes,
COST 273 TD (02)-108, presented at 5th Management Committee Meeting of COST Action 273, Towards Mobile Broadband Multimedia Networks,
Lisboa, Portugal, Sep. 19-20, 2002.

L. Knudsen and D. Wagner,
Integral cryptanalysis,
Proceedings of 2002 Fast Software Encryption,
Leuven, Belgium, February 4 - 6, 2002, p. 112-127.

J.S. No, D.J. Shin and T. Helleseth,
On the p-ranks and Characteristic Polynomials of Cyclic Difference Sets,
Proceedings of 2002 IEEE Int. Symposium on Information Theory,
Lausanne, Switzerland, June 30 - July 5, 2002, p. 96.

M.G. Parker,
A construction for Binary Sequence Sets with Low Peak-to-Average Power Ratios,
Proceedings of 2002 IEEE Int. Symposium on Information Theory,
Lausanne, Switzerland, June 30 - July 5, 2002, p. 239.

M.G. Parker, K.G.Paterson and C. Tellambura,
Golay Complementary Sequences,
Wiley Encyclopedia of Telecommunications, Editor: J.G.Proakis, Wiley Interscience, 2002.

E. Rosnes and Ø. Ytrehus,
On Algorithms for Determination of Turbo Code Weight Distribution,
Proceedings of 2002 IEEE Int. Symposium on Information Theory,
Lausanne, Switzerland, June 30 - July 5, 2002, p. 82.

E. Rosnes and Ø. Ytrehus,
Reduced Trellis State Complexity Convolutional Code Constructions,
Proceedings 2002 International Symposium on Information Theory and Its Applications,
Xi'an, Kina, 7. - 11. okt 2002, p. 295-298.

C. Tellambura M.G. Parker,
Relationship between Hamming Weight and Peak-to-Mean Envelope Power Ratio of Orthogonal Frequency Division Multiplexing,
Proceedings of 2002 IEEE Int. Symposium on Information Theory,
Lausanne, Switzerland, June 30 - July 5, 2002, p. 239.

C. Tellambura and M.G. Parker,
Peak-to-average power ratio of orthogonal frequency division multiplexing,
Wiley Encyclopedia of Telecommunications, Editor: J.G.Proakis, Wiley Interscience, 2002.

G. E. Øien, R. K. Hansen, D. V. Duong, H. Holm, and K. J. Hole,
Bit error rate analysis of adaptive coded modulation with mismatched and complexity-limited channel prediction,
Proc. 5th Nordic Signal Processing Symposium (NORSIG-2002),
Hurtigruten, Norway, Oct. 4-7, 2002.

G. E. Øien, H. Holm, and K. J. Hole,
Channel prediction for adaptive coded modulation in Rayleigh fading,
Proc. XI European Singnal Processing Conference (EUSIPCO-2002),
Toulouse, France, Sept. 3-6, 2002.

G. E. Øien, H. Holm, and K. J. Hole,
Adaptive coded modulation with imperfect channel state information: system design and performance analysis aspects,
invited paper Proc. IEEE International Symposium on Advances in Wireless Communications (ISWC 02),
Victoria, BC, Canada, Sept. 23-24, 2002, 19-20.

G. E. Øien, H. Holm, and K. J. Hole,
Adaptive coded modulation enhanced by channel prediction and antenna diversity,
COST 273 TD (02)-054, presented at 4th Management Committee Meeting of COST Action 273, Towards Mobile Broadband Multimedia Networks,
Espoo, Finland, May 30-31, 2002.

Ø. Ytrehus,
An introduction to Turbo Codes and Iterative Decoding,
Telektronikk (special issue on information theory and its applications) 98 (2002) 65-78 (published by Telenor).

2001

W. Chen and T. Kløve,
Weight hierarchies of extremal non-chain ternary codes of dimension 4,
Proceedings of 2001 IEEE Int. Symposium on Information Theory,
Washington D.C., USA, June 24-29, 2001, p. 109.

F. Fu, T. Kløve, Y. Luo, and V.K. Wei,
Equidistant Constant Weight Codes,
Proceedings of the International Workshop on Coding and Cryptography,
Paris, France, January 8-12, 2001, pp. 225--232.

F. Fu, T. Kløve, Y. Luo, and V.K. Wei,
On the Svanström Bound for Ternary Constant Weight Codes,
Proceedings of 2001 IEEE Int. Symposium on Information Theory,
Washington D.C., USA, June 24-29, 2001, p. 12.

F. Fu, T. Kløve and V.K. Wei,
On the Undetected Error Probability for Binary Codes,
Proceedings of 2001 IEEE Int. Symposium on Information Theory,
Washington D.C., USA, June 24-29, 2001, p. 154.

N. Hamada and T. Helleseth,
Codes and minihypers,
Proceedings of the EuroWorkshop on Optimal Codes and Related Topics,
Sunny Beach, Bulgaria, June 10-16, 2001, pp. 79--84.

T. Helleseth,
Sequences with ideal autocorrelation,
Proceedings of the EuroWorkshop on Optimal Codes and Related Topics,
Sunny Beach, Bulgaria, June 10-16, 2001, pp. 91--95.

T. Helleseth, T. Kløve and V. Levenshtein,
Ordered orthogonal arrays of strength 4 and 5 from double-error-correcting BCH codes,
Proceedings of 2001 IEEE Int. Symposium on Information Theory,
Washington D.C., USA, June 24-29, 2001, p. 201.

T. Helleseth and K. Yang,
On binary sequences of period pm-1 with optimal autocorrelation,
Proceedings of Sequences and Their Applications,
Bergen, Norway, May 13-17, 2001, p. 29.

K. J. Hole, H. Holm and G. E. Øien,
Analysis of Adaptive Coded Modulation with Antenna Diversity and Feedback Delay,
Proceedings of IST 2001 Mobile Communications Summit(IST 2001),
Barcelona, Spain, September 9-12 (2001), pp. 865-870.

K.J. Hole and G. E. Øien,
Adaptive coding and modulation: a key to bandwidth-efficient multimedia communications in future wireless systems,
Telektronikk (special issue on wireless future) 97 (2001) 49-57 (published by Telenor).

K. J. Hole, G. E. Øien, B. Risløw, and P. Orten,
Rate-adaptive modulation and coding in fixed Ka-band satellite communications: a feasibility study,
Proc. Nordic Radio Symposium (NRS 01),
Nynäshamn, Sweden, April 3-5, 2001.

L.R. Knudsen and C.J. Mitchell,
An analysis of the 3gpp-MAC scheme,
Proceedings of the International Workshop on Coding and Cryptography,
Paris, France, January 8-12, 2001, pp. 319--328.

C. Martìnez-Pérez, H. G. Schaathun and W. Willems,
On the weight hierarchies of product codes,
Proceedings of the International Workshop on Coding and Cryptography,
Paris, France, January 8-12, 2001, pp. 225--232.

M.G. Parker and V. Rijmen,
The Quantum Entanglement of Bipolar Sequences,
Proceedings of Sequences and Their Applications,
Bergen, Norway, May 13-17, 2001, p. 49.

M.G. Parker and V. Rijmen,
The Quantum Entanglement of Bipolar Sequences,
Discrete Mathematics and Theoretical Computer Science Series, Springer, 2001.

M.G. Parker and C. Tellambura,
Generalized Rudin-Shapiro constructions,
Proceedings of the International Workshop on Coding and Cryptography,
Paris, France, January 8-12, 2001, pp. 413--423.

H. Raddum and L. L.R. Knudsen,
A Differential Attack on Reduced-Round SC2000,
Selected Areas in Cryptography, Proceedings of Selected Areas in Cryptography,
Toronto, Canada, 16-17 August 2001, pp. 207--215.

E. Rosnes,
Generalized Kay estimator for the frequency of a single complex sinoid,
Proceedings of 2001 IEEE International Conference on Communications,
Helsinki, Finland, June 11-14, 2001, pp. 2958-2962.

E. Rosnes and Ø. Ytrehus,
Fast algorithms for determining the weight distribution of turbo codes,
Proceedings of Mini-Workshop on Convolutional Codes,
Essen, Germany, 3-5 Oct. 2001.

H. G. Schaathun,
A lower bound on the greedy weights of product codes and projective multisets,
Proceedings of 2001 IEEE Int. Symposium on Information Theory,
Washington D.C., USA, June 24-29, 2001, p. 120.

H. G. Schaathun and W. Willems,
A lower bound for the weight hierarchy of product codes,
Proceedings of 2001 IEEE Int. Symposium on Information Theory,
Washington D.C., USA, June 24-29, 2001, p. 59.

G. E. Øien and K. J. Hole,
Maximum average spectral efficiency of slowly varying Rayleigh fading channels with pilot-symbol-assisted channel estimation,
Proc. 4th European Personal Mobile Communications Conference (EPMCC 2001),
Vienna, Austria, Feb. 20-22, 2001.

2000

Á. Barbero and Ø. Ytrehus,
Modifications of the Rao-Nam cryptosystem,
in: J. Buchmann et al. (eds.): Coding Theory, Cryptography and Related Areas, Proc. Intern. Conf. on Coding Theory, Cryptography and Related Areas,
Guanajuato, 20-24 April, 1998, Springer Verlag, 2000, 1-12.

H. Dobbertin, T. Helleseth, V. Kumar and H. Martinsen,
Ternary m-sequences with three-valued crosscorrelation function: two new decimations,
Proc. International Symposium on Information Theory (ISIT'2000),
Sorrento, Italia, 25-30 June, 2000, 329.

Fang-Wei Fu, T. Kløve, and Shi-Yi Shen,
On the undetected error probability of m-out-of-n codes on the binary symmetric channel,
in: J. Buchmann et al. (eds.): Coding Theory, Cryptography and Related Areas, Proc. Intern. Conf. on Coding Theory, Cryptography and Related Areas,
Guanajuato, 20-24 April, 1998, Springer Verlag, 2000, 102-110.

T. Helleseth,
On some ternary m-sequences with good autocorrelation and crosscorrelation,
Proc. Seventh International Conference in Algebraic and Combinatorial Coding Theory (ACCT'7),
Bansko, Bulgaria, 18-24 June, 2000, 168-171.

T. Helleseth, V. Kumar and H. Martinsen,
A new family of ternary sequences with ideal two-level autocorrelation function,
Proc. International Symposium on Information Theory (ISIT'2000),
Sorrento, Italia, 25-30 June, 2000, 328.

T. Helleseth and V. Zinoviev,
On Z4-linear Goethals codes, Kloosterman sums and Dickson polynomials,
Proc. Seventh International Conference in Algebraic and Combinatorial Coding Theory (ACCT'7),
Bansko, Bulgaria, 18-24 June, 2000, 168-171.

T. Kløve,
Classification of permutation codes of length 6 and minimum distance 5,
Proceedings, ISITA,
Honolulu, Hawaii, USA, Nov. 5-8, 2000, pp. 465--468.

T. Kløve,
A combinatorial problem motivated by a data transmission application,
Proceedings, Norsk Informatikkonferanse (NIK),
Bodø, Norway, Nov. 20-22, 2000, pp. 55--66.

J.S. No, H. Chung, H.Y. Song, K. Yang, J.D. Lee and T. Helleseth,
Balanced and almost balanced binary sequences of period pm-1 with optimal autocorrelation using the polynomial (z+1)d+azd+b over GF(pm),
Proc. International Symposium on Information Theory (ISIT'2000),
Sorrento, Italia, 25-30 June, 2000, 298.

M.G. Parker,
Constabent properties of Golay-Davis-Jedwab sequences,
Proc. International Symposium on Information Theory (ISIT'2000),
Sorrento, Italia, 25-30 June, 2000, 302.

M.G. Parker,
Quantum Factor Graphs,
Proceedings of the 2nd Int. Symp. on Turbo Codes and Related Topics,
Brest, France, Sept 4-7, 2000, pp. 59--62.

M.G. Parker and M.H. Lee,
Optimal Bipolar Sequences for the Complex Reverse-Jacket Transform,
Proceedings, ISITA,
Honolulu, Hawaii, USA, Nov. 5-8, 2000, pp. 425--428.

H. G. Schaathun,
Projective systems and higher weights,
Proc. International Symposium on Information Theory (ISIT'2000),
Sorrento, Italia, 25-30 June, 2000, 255.

1999

Á. Barbero and Ø. Ytrehus,
(d,k) constrained codes with bit-oriented and destined trellises,
Abstracts, 5th International conference on Finite Fields and Applications,
Augsburg, Germany 2-6 August 1999.

Wende Chen and T. Kløve,
On a class of weight hierarchies of binary linear codes of dimension 4,
Abstracts, Third Shanghai Conf. on Designs, Codes and Finite Geometries,
Shanghai, 14-18 May, 1999.

H. Holm, K. J. Hole, G. E. Øien,
Spectral efficiency of variable-rate coded QAM for flat fading channels,
Proc. NORSIG-99,
Asker, Norway, Sep. 9-11, 1999, 130-135.

T. Kløve, Fang-Wei Fu and Shi-Yi Shen,
On the undetected error probability threshold of m-out-of-n codes on the binary symmetric channel,
Proc. 5th Intern. Symp. on DSP for Communication Systems,
Perth, Australia, 1-4 Februar, 1999, 252-256.

T. Kløve,
On the Newton radius of linear codes,
Abstracts, Third Shanghai Conf. on Designs, Codes and Finite Geometries,
Shanghai, 14-18 May, 1999.

K. Shum, P.V. Kumar and T. Helleseth,
The L-function of Gold exponential sums,
Proceedings of the Fifth International Conference on Finite Fields and Applications,
Augsburg, Germany, August 2-6, 1999, 418-427.

1998

Á. I. Barbero and Ø. Ytrehus,
Modifications of the Rao-Nam cryptosystem,
Abstracts, Intern. Conf. on Coding Theory, Cryptography and Related Areas, Guanajuato, 20-24 april, 1998, 23.

F. Fu, T. Kløve and S. Xia,
On the undetected error probability of m-out-of-n codes on the binary symmetric channel,
Intern. Conf. on Coding Theory, Cryptography and Related Areas, Guanajuato,20-24 April, 1998, 10.

E. Gabidulin and T. Kløve,
The Newton radius of MDS codes,
Proc. 1998 Information Theory Workshop, Killarney, Ireland, June 22-26, 1998, 50-51.

E. Gabidulin and T. Kløve,
On a bound involving the covering radius and the Newton radius,
Proc. 1998 IEEE Int. Symposium on Information Theory, MIT, Cambridge, Mass, August 16-21, 1998, 433.

T. Helleseth,
On the crosscorrelation of m-sequences and related topics,
Preproc. Int. Conference on Sequences and Their Applications, Singapore 14-17 des. 1998, 5.

T. Helleseth and P.V. Kumar, Sequences with low correlation,
Chapter 21, in: Handbook of Coding Theory, V.S. Pless and W.C. Huffman (ed.), Elsevier 1998, pp. 1765-1853.

T. Helleseth, P.V. Kumar, H.M. Martinsen, O.N. Vassbakk,
Correlation distribution of the quaternary Kasami sequences,
Preproc. Int. Conference on Sequences and Their Applications, Singapore 14-17 des. 1998, 17.

T. Helleseth, C. Rong and K. Yang,
Some 3-designs from Goethals codes over Z4,
Proc. II International Workshop on Optimal Codes, Sozopol, June 9-15, 1998, 84-89.

T. Helleseth and V. Zinoviev,
On the coset weight distribution of the Z4-linear Goethals codes,
Proc. 1998 IEEE Int. Symposium on Information Theory, MIT, Cambridge, Mass, August 16-21, 1998, 400.

K. Yang and T. Helleseth,
Kerdock codes over Z4 and their application to designs,
Proc. 1998 IEEE Int. Symposium on Information Theory, MIT, Cambridge, Mass, August 16-21, 1998, 399.

1997

K. A. S. Abdel-Ghaffar and Ø. Ytrehus,
Difference set codes for (1-D) partial-response channels,
Proc. 1997 IEEE International Symposium on Information Theory, Ulm, Germany, June 29- July 4, 460.

T. Helleseth, T. Kløve and V. Levenshtein,
On the information function of an error correcting code,
Proc. 1997 IEEE International Symposium on Information Theory, Ulm, Germany, June 29- July 4, 362.

T. Helleseth, T. Kløve (ed.),
IEEE Information Theory Workshop, Abstracts, Longyearbyen, July 6-12, 1997 (77 pp.).

T. Helleseth, P. V. Kumar, A. G. Shanbhag and K. Yang,
On the weight hierarchy of some codes over Z4,
Abstracts, IEEE Information Theory Workshop, Longyearbyen, July 6-12, 1997, 7-8.

T. Helleseth, P. V. Kumar, C. Rong and K. Yang,
On infinite families of 3-designs from Preparata codes and related codes over Z4,
Proc. Thirty-fifth Annual Allerton Conference on Communication, Control and Computing, Monticello, Sept. 29-Oct. 1, 1997, 395-403.

K. J. Hole and Ø. Ytrehu,
How to determine cosets of convolutional codes with least possible maximum zero-run length,
Proc. 1997 IEEE International Symposium on Information Theory, Ulm, Germany, June 29- July 4, 289.

P. V. Kumar and T. Helleseth,
An expansion for the coordinates of the trace function over Galois rings,
Abstracts IEEE Information Theory Workshop, Longyearbyen, July 6-12, 1997, 5-6.

H. A. Martinsen,
Large linear complexity sequences over Z8,
Proc. 1997 IEEE International Symposium on Information Theory, Ulm, Germany, June 29- July 4, 40.

C. Rong and T. Helleseth,
The algebraic decoding of the Z4-linear Calberbank-McGuire code,
Proc. 1997 IEEE International Symposium on Information Theory, Ulm, Germany, June 29- July 4, 328.

K. Yang and T. Helleseth,
On the minimum support weights of Goethals codes over Z4,
Proc. 1997 IEEE International Symposium on Information Theory}, Ulm, Germany, June 29- July 4, 204.

K. Yang and T. Helleseth,
On the generalized Hamming weights for Preparata codes over Z4,
Proc. 1997 IEEE International Symposium on Information Theory, Ulm, Germany, June 29- July 4, 205.

Ø. Ytrehus,
Trellis complexity and generalized Hamming weights,
Abstracts, IEEE Information Theory Workshop, Longyearbyen, July 6-12, 1997, 71-72.

Ø. Ytrehus,
On codes for error correction and block synchronization,
Proc. Thirty-fifth Annual Allerton Conference on Communication, Control and Computing, Monticello, Sept. 29-Oct. 1, 1997, 432-439.

1996

I. Boukliev, S. Dodunekov, T. Helleseth and Ø. Ytrehus,
Two new binary optimal 8-dimensional codes,
Proc. Fifth International Workshop on Algebraic and Combinatorial Coding Theory, Sozopol, Bulgaria June 1-7, 1996, 66-67.

W. Chen and T. Kløve,
The weight hierarchies of q-ary codes of dimension 2 and 3,
The Second Shanghai Conference on Designs, Codes and Finite Geometries, May 15--19, 1996, 15-16.

T. Helleseth and T. Kløve,
Bounds on the weight hierarchies of some product codes,
Arithmétique, Géométrie, et Algorithmique dans la Théorie des Codes correcteurs d'erreurs, Pointe-á-Pitre, Guadeloupe, 1-5 April 1996, 3pp.

T. Helleseth and T. Kløve and V. Levenshtein,
The Newton radius of equidistant codes,
Proc. 1996 IEEE International Symposium on Information Theory and Its Applications, Victoria, Canada, September 17-20, 1996, 721-722.

T. Helleseth and P.V. Kumar,
Pseudonoise Sequences,
Chapter 8, in: The Mobile Communications Handbook, J. Gibson (ed.), CRC Press 1996, pp. 110-122.

T. Helleseth and P.V. Kumar,
Pseudonoise Sequences,
Chapter 8, in: Communications Handbook, J. Gibson (ed.), CRC Press 1996, pp. 94-106.

T. Kløve and Y. Svirid,
Diffuse Difference Triangle Sets,
The Second Shanghai Conference on Designs, Codes and Finite Geometries, Shanghai, May 15-19, 1996, 22-23.

Ø. Ytrehus and K. J. Hole,
Self-synchronizing cosets of convolutional codes,
Proc. 1996 IEEE International Symposium on Information Theory and Its Applications, Victoria, Canada, September 17-20, 1996, 823-826.

K. Yang, T. Helleseth, P. V. Kumar and A.G. Shanbhaq,
On the generalized Hamming weights of Kerdock codes over Z4,
Proc. 1996 IEEE International Symposium on Information Theory and Its Applications, Victoria, Canada, September 17-20, 1996, 39-42.

1995

X. Chen, I. S. Reed and T. Helleseth,
On Grobner bases of the error-locator ideal of Hermitian codes,
Proc. 1995 IEEE Int. Symposium on Information Theory, Whistler, Canada, September 17-22, 1995, 94.

R. Erstad, M. Fjelltveit Hole, K. J. Hole and Ø. Ytrehus,
Convolutional codes for partial-response channels,
Proc. of the SPIE Conf. on Coding and Signal Processing for Information Storage, Philadelphia, Pennsylvania, USA, 1995.

N. Hamada and T. Helleseth,
A characterization of {3v1+v4,3v0+v3;4,3}-minihypers and projective ternary [78,5,51] codes,
Proc. Int. Workshop on Optimal Codes and Related Topics, Sozopol, Bulgaria, 26 May-1 June 1995, 61-64.

N. Hamada and T. Helleseth,
The nonexistense of ternary [270,6,179] and [309,6,205] codes,
Proc. Int. Workshop on Optimal Codes and Related Topics, Sozopol, Bulgaria, 26 May-1 June 1995, 65-68.

T. Helleseth and P.V. Kumar,
A new proof of the minimum distance of the quaternary Preparata code and Goethals code,
Proc. Int. Workshop on Optimal Codes and Related Topics, Sozopol, Bulgaria, 26 May-1 June 1995, 69-73.

T. Helleseth and P.V. Kumar,
The algebraic decoding of the Z4-linear Goethals code,
Proc. 1995 IEEE Int. Symposium on Information Theory, Whistler, Canada, 17-22 Sept. 1995, 408.

T. Helleseth, P.V. Kumar and A. Shanbhag,
New Codes with the same Parameters as the Goethals Codes and the Delsarte-Goethals Codes,
Proc. American Mathematical Society Meeting, Chicago, USA, 24-25 March, 1995.

T. Helleseth, P. V. Kumar og A. G. Shanbag,
New codes with the same weight distribution as the Goethals codes and the Delsarte-Goethals codes,
Proc. 1995 IEEE Int. Symposium on Information Theory, Whistler, Canada, September 17-22, 1995, 274.

T. Helleseth, P. V. Kumar, A. G. Shanbag and K. Yang,
On Galois rings: a Hasse-Davenport-type relation for Z4 Kerdock code and applications,
Proc. 33rd Allerton Conference on Communication Control and Coding, Monticello, Illinois, USA, Oct. 4-7, 1995, 480-482.

T. Helleseth, P. V. Kumar, O. Moreno og A. G. Shanbag,
Improved estimates for the minimum distance of weighted degree Z4 trace codes,
Proc. 1995 IEEE Int. Symposium on Information Theory, Whistler, Canada, September 17-22, 1995, 283.

T. Helleseth and E. Winjum,
The generalized Hamming weight of some BCH codes and related codes,
Proc. 1995 IEEE Int. Symposium on Information Theory}, Whistler, Canada, September 17-22, 1995, 281.

K. J. Hole and Ø. Ytrehus,
Further results on cosets of convolutional codes with short maximum zero-run lengths,
Proc. 1995 IEEE Int. Symposium on Information Theory}, Whistler, Canada, September 17-22, 1995, 146.

K. J. Hole, Ø. Ytrehus, R. Erstad and M. Fjelltveit Hole,
Convolutional Codes for Partial Response Channels,
Proceedings of First International Symposium on Photonics Technologies and Systems for Voice, Video, and Data Communications, Philadelphia, Pennsylvania, USA, October 23-26, 1995, 103-114.

T. Kløve,
Near-MDS codes for error detection,
Proc. Int. Workshop on Optimal Codes and Related Topics, Sozopol, Bulgaria, 26 May-1 June 1995, 103-107.

T. Kløve,
The worst-case probability of undetected error for linear codes on the local binomial channel,
Proc. 1995 IEEE Int. Symposium on Information Theory, Whistler, Canada, 17-22 Sept. 1995, 342.

T. Kløve,
On codes satisfying the double chain condition,
Proc. 33rd Allerton Conference on Communication Control and Coding, Monticello, Illinois, USA, Oct. 4-7, 1995, 714-723.

T. Kløve and V. Korzhik,
Error Detecting Codes, General Theory and their Application in Feedback Communication Systems,
Kluwer Acad. Publ. 1995, 249 pp.

T. Kløve and Y. Svirid,
Diffuse difference triange sets,
Proc. 1995 IEEE Int. Symposium on Information Theory, Whistler, Canada, 17-22 Sept. 1995, 237.

P.V. Kumar, T. Helleseth and A. Shanbhag,
An Upper Bound for Weil Exponential Sums over Galois Rings and Applications,
Proc. American Mathematical Society Meeting, Chicago, USA, 24-25 March, 1995.

C. Rong and T. Helleseth,
Use Characteristic Sets to Decode Cyclic Codes up to Actual Minimum Distance,
Proc. The 3rd International Conference on Finite Fields and Applications, Glasgow, Scotland, 11-14 July, 1995.

A. G. Shanbag, P. V. Kumar and T. Helleseth,
An upper bound for extended Kloosterman sums over Galois rings,
Proc. 1995 IEEE Int. Symposium on Information Theory, Whistler, Canada, September 17-22, 1995, 88.

A. G. Shanbag, P. V. Kumar and T. Helleseth,
An upper bound for the aperiodic correlation of some q-ary sequences,
Proc. 1995 IEEE Int. Symposium on Information Theory}, Whistler, Canada, September 17-22, 1995, 92.

Ø. Ytrehus,
Ascetic convolutional codes,
Proc. 33rd Allerton Conference on Communication Control and Coding}, Monticello, Illinois, USA, Oct. 4-7, 1995, 382-390.

Other publications

2007

C. Riera, L.E. Danielsen and M. Parker, On pivot orbits of Boolean functions, arXiv:math/0604396v1 [math.CO], April 2006.

C. Riera and M. Parker, A generalization of graph states to two-graph states,
International Workshop on International Measurement Based Quantum Computing, Oxford, UK, 18-21 March 2007, (Poster).

2006

I. Naydenova and T. Kløve, Necessary conditions for codes to be good for error detection, Bulgaria: Institute of Mathematics and Informatics 2006. ISBN 954-8324-96-2. 31 pp.

F.-W. Fu and T. Kløve, Large binary codes for error detection,
Reports in Informatics, no.~315, Department of Informatics, University of Bergen, Norway, Feb. 2006.

2005

D. V. Duong, G. E. Øien, and K. J. Hole, Adaptive coded modulation with receive antenna diversity and imperfect channel knowledge at receiver and transmitter, COST 273 TD (05)-009, presented at
12th Management Committee Meeting of COST Action 273, Towards Mobile Broadband Multimedia Networks, Bologna, Italy, Jan. 20-21, 2005.

P. Ellingsen, Iterative decoding for the asymmetric channel,
Reports in Informatics, no.~295, Department of Informatics, University of Bergen, Norway, Apr. 2005.

T. Helleseth and A. Kholosha, Monomial and quadratic bent functions over the finite fields of odd characteristic,
Reports in Informatics, no.~310, Department of Informatics, University of Bergen, Norway, Sept. 2005.

J. E. Mathiassen, Improved collision attack on OCB,
Reports in Informatics, no.~306, Department of Informatics, University of Bergen, Norway, Sept. 2005.

H. G. Schaathun and M. Fernandez-Munoz, Boneh-Shaw fingerprinting and soft decision decoding,
Reports in Informatics, no.~289, Department of Informatics, University of Bergen, Norway, Jan. 2005.