Publications and Interests

Hans Georg Schaathun

(Last update: $Date: 2004/01/19 15:41:58 $)

English Norsk


Graduate Students

Interests (with publications and preprints)

Technical Reports

Accepted or published articles

  1. with Marcel Fernandez. Soft decision decoding of Boneh-Shaw fingerprinting codes. Accepted for publication in IEICE Transactions. 2006.
  2. The Boneh-Shaw Fingerprinting Scheme is better than we thought. IEEE Transactions of Information Forensics and Security 1(2):248-255, June 2006.
  3. with Gérard D. Cohen: Nested codes for constrained memory and for dirty paper AAECC-16, Las Vegas 2006.
  4. with Gérard D. Cohen: A trellis-based bound on (2,1)-separating codes Coding and Cryptography, Cirencester December 2005.
  5. with Tor Helleseth: The second support weight distribution of the Kasami codes . IEEE Trans. Inform. Theory, to appear.
  6. with Tor Helleseth: On the (2,1)-separating weight of the Kerdock code , IEEE Trans. Inform. Theory, 50(12), December 2004, pages 3312-3315
  7. with Gérard D. Cohen: Separating codes: constructions and bounds, Springer LNCS 2976, pages 322-328 (2004).
  8. with Gérard D. Cohen: Upper bounds on separating codes, IEEE Trans. Inform. Theory, 50(6) June 2004 pages 1291-1295
  9. Duality and support weight distributions (PS/PDF), IEEE Trans. Inform. Theory, 50(5) May 2004, pages 862-867.
  10. with Tor Helleseth: Separating and intersecting properties of BCH and Kasami codes, Springer Lecture Notes in Computer Science 2898, `Cryptography and Coding' 9th IMA International Conference Cirenceseter, UK, December 2003, pp. 52-65. (PostScript)
  11. Fighting two pirates, Springer Lecture Notes in Computer Science 2643, AAECC-15, 2003.
  12. A lower bound on the greedy weights of product codes, Designs, Codes, and Cryptography, vol. 31(1), pages 27-42, January 2004.
  13. with Wolfgang Willems: A lower bound on the weight hierarchies of product codes. Discrete Applied Mathematics 128 (2003) pp. 251-261, special issue for WCC 2001.
  14. with Gérard Cohen, Simon Litsyn and Sylvia Encheva: Intersecting codes and separating code. Discrete Applied Mathematics 128 (2003), special issue for WCC 2001. Erratum in Discrete Applied Mathematics 131(1) pages 75-83 (2003).
  15. with Gérard Cohen and Sylvia Encheva: More on (2,2)-separating systems IEEE Trans. Inform. Theory 48(9), September 2002, pp. 2606-2609
  16. Duality and Greedy Weights of Linear Codes and Projective Multisets. (DVI or PS) Springer-Verlag Lecture Notes in Computer Science, AAECC-14, Melbourne 2001.
  17. Upper Bounds on Weight Hierarchies of Extremal Non-Chain Codes 2000 (PDF/PS/DVI) Discrete Mathematics, vol. 241, pages 449-469; October 2001. Selected Papers in honor of Helge Tverberg.
  18. The Weight Hierarchy of Product Codes (PostScript/DVI) IEEE Trans. Inform. Theory November 2000, volume 46, no. 6, pages 2648--2651. This paper gives a proof of a conjecture by Wei and Yang 1993 and a lower bound on the weight hierarchy of arbitrary product codes.

Hans Georg / georg@ii.uib.no