Matthew Geoffrey Parker

Researcher, University of Bergen, Bergen, Norway




Address:
Selmer Center,
Inst. for Informatikk,
Høyteknologisenteret i Bergen,
University of Bergen,
Bergen 5020,
Norway.
Tel: +47 55 58 4192
Fax: +47 55 58 4199

Email contact: m a t t h e w @ i i . u i b . n o



Twelfth Institute of Mathematics and its Applications International Conference on Cryptography and Coding, Dec 15th - 17th, 2009, Cirencester, UK


I research into sequence design, Boolean functions, quantum computers, coding theory, cryptography, information theory, communications systems, graph theory, number theory, and efficient algorithms for VLSI.

I am currently running a NFR-funded project entitled Hybrid Quantum Computers.

This is where I work:
Selmer Centre/ Department of Informatics/University of Bergen

I have previously been involved with the Network of Excellence in Cryptology, ECRYPT, and the
ECRYPT Stream Cipher Project (eSTREAM)

and, before that, the New European Schemes for Signatures, Integrity, and Encryption:
NESSIE


This is how to get to the Institute for Informatics


Publications

Journal Papers Submitted

Lars Eirik Danielsen and Matthew G. Parker, Interlace polynomials: Enumeration, unimodality, and connections to codes, [pdf] Submitted for publication, Apr. 2008. arxiv.org/abs/0804.2576.

Journal Papers Published or Accepted for Publication

Jonathan Jedwab and Matthew G. Parker, A construction of binary Golay sequence pairs from odd-length Barker sequences, [pdf] J. Combin. Designs, accepted 2009.

Kai-Uwe Schmidt, Jonathan Jedwab and Matthew G. Parker, Two binary sequence families with large merit factor, [pdf] Advances in Mathematics of Communication, Vol. 3, No. 2, pp. 135-156, May 2009.

Matthew G. Parker, Close encounters with Boolean functions of three different kinds, [pdf] 2nd International Castle Meeting on Coding Theory and Applications, 2ICMCTA, Castillo de la Mota. Medina del Campo (Valladolid), Lecture Notes in Computer Science, LNCS 5228, 15-19 September 2008.

Joakim Grahl Knudsen, Constanza Riera, Matthew G. Parker and Eirik Rosnes, Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation [pdf] 2nd International Castle Meeting on Coding Theory and Applications, 2ICMCTA, Castillo de la Mota. Medina del Campo (Valladolid), to be published in Lecture Notes in Computer Science, LNCS 5228, 15-19 September 2008.

Kai-Uwe Schmidt, Matthew G. Parker, and Alexander Pott, Negabent Functions in the Maiorana-McFarland Class, [pdf] Sequences and Their Applications - SETA 2008, University of Kentucky, Lexington, KY, Lecture Notes in Computer Science, LNCS 5203, Sept. 14-18, 2008.

Constanza Riera and Stephane Jacob and Matthew G. Parker, From Graph States to Two-Graph States, [pdf, postscript] Designs, Codes and Cryptography, vol. 48, (2), August, 2008. preprint at: arxiv.org/abs/0801.4754.

Frank Fiedler and Jonathan Jedwab and Matthew G. Parker, A Framework for the Construction of Golay Sequences, [pdf, postscript] IEEE Trans. Inform. Theory, vol. 54 pp. 3114–3129, 2008.

Lars Eirik Danielsen and Matthew G. Parker, Edge Local Complementation and Equivalence of Binary Linear Codes, [pdf] Designs, Codes and Cryptography, 49:1-3 December 2008. preprint at: arxiv.org/abs/0710.2243.

Frank Fiedler and Jonathan Jedwab and Matthew G. Parker, A Multi-dimensional Approach to the Construction and Enumeration of Golay Complementary Sequences, [pdf, postscript] J. Combinatorial Theory (Series A), vol. 115 pp. 753-776, 2008.

Matthew G. Parker and Alexander Pott, On Boolean functions which are bent and negabent, [pdf, postscript] 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.

Jonathan Jedwab and Matthew G. Parker, Golay Complementary Array Pairs, [pdf, postscript] Designs, Codes and Cryptography, 44, pp. 209-216, July 2007.

Jonathan Jedwab and Matthew G. Parker, There are no Barker arrays having more than two dimensions, [pdf, postscript] Designs, Codes and Cryptography, 43, 2-3, pp. 79-84, June 2007.

Lars Eirik Danielsen and Matthew G. Parker, On the classification of all self-dual additive codes over GF(4) of length up to 12, Journal of Combinatorial Theory, Series A, 113, 7, pp. 1351-1367, Oct. 2006. [pdf, postscript] preprint at: math.CO/0504522.

Lars Eirik Danielsen, T. Aaron Gulliver and Matthew G. Parker Aperiodic Propagation Criteria for Boolean Functions, [pdf, postscript] Inform. Comput., 204, 5, pp. 741-770, 2006.

Constanza Riera and Matthew G. Parker, Generalised Bent Criteria for Boolean Functions (I), [pdf, postscript] IEEE Trans Inform. Theory, 52, 9, pp. 4142-4159, Sept. 2006. Also at: cs.IT/0502049.

Constanza Riera and Matthew G. Parker, One and Two-Variable Interlace Polynomials: A Spectral Interpretation, [pdf, postscript] International Workshop, Proceedings of WCC2005, Bergen, Norway, March 2005, Revised Selected Papers, Lecture Notes in Computer Science, LNCS 3969, pp. 397-411, March 2005.

Matthew G. Parker, Univariate and Multivariate Merit Factors, [pdf, postscript] Proceedings of SETA04, Lecture Notes in Computer Science, LNCS 3486, pp. 72-100, 2005.

L. E. Danielsen and M. G. Parker, Spectral orbits and peak-to-average power ratio of Boolean functions with respect to the {I,H,N}^n transform, [pdf, postscript] Proceedings of SETA04, Lecture Notes in Computer Science, LNCS 3486, pp. 373-388, 2005. Also at: cs.IT/0504102.

R.Kristiansen and M.G.Parker, Binary Sequences with Merit Factor > 6.3, [pdf, postscript] IEEE Trans. Inform. Theory, Vol 50, pp. 3385-3389, Dec. 2004.

T.Wo,C.Ding,S.Chanson,T.Helleseth and M.G.Parker, Logarithm Cartesian Authentication Codes, [pdf, postscript] Information and Computation, Vol. 184, Issue 1, pp. 93-108, 10 July, 2003.

M.G.Parker and V.Rijmen, The Quantum Entanglement of Binary and Bipolar Sequences [pdf, postscript] - also at: quant-ph/0107106. A shorter version is in Sequences and Their Applications, SETA'01, Discrete Mathematics and Theoretical Computer Science Series, Springer, 2001, Ed.: T.Helleseth, P.V.Kumar and K.Yang, Presented in part at SETA01, Bergen, Norway, May 13-17, 2001.

M.G.Parker, Even Length Binary Sequence Families with Low Negaperiodic Autocorrelation [pdf, postscript] LNCS 2227, pp 200 --, (2001), Copyright Springer-Verlag
Presented at AAECC-14, Nov 26-30, Melbourne, Australia, 2001.

M.G.Parker, Quantum Factor Graphs (long version) [pdf, postscript] Annals of Telecom., July-Aug, pp 472-483, 2001. also at: quant-ph/0010043.

M.G.Parker,A.H.Kemp and S.J.Shepherd, Fast Blum-Blum-Shub Sequence Generation Using Montgomery Multiplication [pdf, postscript]. IEE Proc-Comput.Digit.Tech, Vol. 147, Issue 4, pp 252-254, July 2000.

M.G.Parker, Conjectures on the Size of Constellations Constructed from Direct Sums of PSK Kernels [pdf, postscript] LNCS 1719,Copyright Springer-Verlag
Presented in part at 13th International Symposium, AAECC-13, Honolulu, Hawaii, pp 420-429, 14-19 Nov, 1999.

C.Tellambura,M.G.Parker,Y.J.Guo,S.J.Shepherd and S.K.Barton, Optimal Sequences for Channel Estimation Using Discrete Fourier Transform Techniques [pdf, postscript] IEEE Trans. on Communications, Vol 47, No 2, pp 230-238, Feb 1999.

S.T.J.Fenn,M.G.Parker,M.Benaissa and D.Taylor, Bit-Serial Multiplication in GF(2^m) Using Irreducible All One Polynomials, [pdf, postscript] IEE Proc-Comput.Digit.Tech, Vol 144, No 6, pp 391-393, Nov 1997.

M.G.Parker and M.Benaissa, Modular Arithmetic Using Low Order Redundant Bases [pdf, postscript] IEEE Trans on Computers, Vol 46, No 5, pp 611-616, May 1997.

M.G.Parker and M.Benaissa, GF(p^m) Multiplication Using Polynomial Residue Number Systems [pdf, postscript]. IEEE Trans on Circuits and Systems II, Vol 42, No 11, pp 718-721, Nov 1995.

M.G.Parker and M.Benaissa, Unusual-Length Number-Theoretic Transforms Using Recursive Extensions of Rader's Algorithm [pdf, postscript] IEE Proc-Vis, Image Signal Process, Vol 142, No 1, pp 31-34, Feb 1995.

M.G.Parker and M.Benaissa, VLSI Structures for Bit Serial Modular Multiplication Using Basis Conversion, [pdf, postscript] IEE Proc-Comput.Digit.Tech, Vol 141,No 6,pp 381-390, Nov 1994.

Refereed Conference Papers Published or Accepted for Publication

Joakim Grahl Knudsen, Constanza Riera, Lars Eirik Danielsen, Matthew G. Parker, and Eirik Rosnes, Iterative Decoding on Multiple Tanner Graphs Using Random Edge Local Complementation [pdf] Int. Symp. Information Theory (ISIT), Seoul, South Korea, 2009.

Lars Eirik Danielsen and Matthew G. Parker, Directed Graph Representation of Half-Rate Additive Codes over GF(4) [pdf] International Workshop on Coding and Cryptography May 10-15, 2009, Ullensvang (Norway). arxiv.org/abs/0902.3883.

Joakim Grahl Knudsen, Constanza Riera, Matthew G. Parker and Eirik Rosnes, Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation [pdf] 2nd International Castle Meeting on Coding Theory and Applications, 2ICMCTA, Castillo de la Mota. Medina del Campo (Valladolid), 15-19 September 2008.

Claude Carlet, Lars Eirik Danielsen, Matthew G. Parker, and Patrick Sole, Self Dual Bent Functions, [pdf] Boolean Functions, Cryptography and Applications, BFCA'08, May 2008.

Lars Eirik Danielsen and Matthew G. Parker, Edge Local Complementation and Equivalence of Binary Linear Codes, [pdf, postscript] Workshop on Coding and Cryptography (WCC), April 2007.

Lars Eirik Danielsen, Constanza Riera, and Matthew G. Parker, Graph Equivalence from Equivalent Quantum States, 20th British Combinatorial Conference, Durham, UK, 10 July - 15 July, 2005.

T. Aaron Gulliver and Matthew G. Parker, The Multivariate Merit Factor of a Boolean Function, [pdf, postscript], ITW2005, IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, Rotorua, New Zealand, 29th Aug. - 1st Sept. 2005.

Lars Eirik Danielsen and Matthew G. Parker, On the classification of all self-dual additive codes over GF(4) of length up to 12, [pdf, postscript] Optimal Codes and Related Topics, Pamporovo, Bulgaria, June 2005.

Constanza Riera and Matthew G. Parker, On Pivot Orbits of Boolean Functions, [pdf, postscript], Optimal Codes and Related Topics, Pamporovo, Bulgaria, June 2005.

Constanza Riera and Matthew G. Parker, Spectral Interpretations of the Interlace polynomial, [pdf, postscript] WCC2005, Bergen, March 2005.

L.E. Danielsen and M.G. Parker, Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with respect to the {I,H,N}^n Transform, - Extended Abstract, Sequences and their Applications, SETA04, Seoul, South Korea, October 2004.

M.G.Parker and C.Tellambura, A Construction for Binary Sequence Sets with Low Peak-to-Average Power Ratio, [pdf, postscript] Int. Symp. Information Theory, Lausanne, Switzerland, pp. 239, June 30-July 5, 2002.

C.Tellambura and M.G.Parker, Relationship Between Hamming Weight and Peak-to-mean Envelope Power Ratio of Orthogonal Frequency Division Multiplexing, [pdf, postscript] Int. Symp. Information Theory, Lausanne, Switzerland, pp. 245, June 30-July 5, 2002.

M.G.Parker, Even Length Binary Sequence Families with Low Negaperiodic Autocorrelation [pdf, postscript] AAECC 14, Nov 26-30, Melbourne, Australia, 2001.

M.G.Parker and V.Rijmen, The Quantum Entanglement of Bipolar Sequences [pdf, postscript] SETA01, Bergen, Norway, May 13-17, 2001.

M.G.Parker and C.Tellambura, Generalised Rudin-Shapiro Constructions [pdf, postscript] WCC2001 International Workshop on Coding and Cryptography, Paris(France), Jan 8-12, 2001. Electronic Notes in Discrete Mathematics, 6, April 2001
Guest Editors: Daniel Augot and Claude Carlet

M.G.Parker and M.H.Lee, Optimal Bipolar Sequences for the Complex Reverse-Jacket Transform [pdf, postscript] ISITA2000, Hawaii, Nov 5-8, 2000.

M.G.Parker, Quantum Factor Graphs (long version) [pdf, postscript] Short version presented at 2nd Int. Symp. on Turbo Codes and Related Topics, Brest, Sept 4-7, 2000. Long version in 'Annals of Telecom', 2001. Also at: quant-ph/0010043.

M.G.Parker, The Constabent Properties of Golay-Davis-Jedwab Sequences, [pdf, postscript] Int. Symp. Information Theory, Sorrento, p. 302, June 25-30, 2000.

M.G.Parker, Conjectures on the Size of Constellations Constructed from Direct Sums of PSK Kernels [pdf, postscript] LNCS 1719,Copyright Springer-Verlag
Presented in part at 13th International Symposium, AAECC-13, Honolulu, Hawaii, pp 420-429, 14-19 Nov, 1999.

M.G.Parker and S.J.Shepherd, The Generation of Finite Alphabet Codewords With No Mutual Cyclic Shift Equivalence [pdf, postscript] 4th Int. Symp. on Communications Theory \& Applications, Ambleside, UK, 13-18 July, 1997.

M.G.Parker,S.J.Shepherd and S.K.Barton, Optimal Mappings of the Spectrum of BPSK/QPSK Sequences to Finite Polynomial Fields and Rings (Extended Abstract) [pdf, postscript] IEEE Information Theory Workshop (ITW '97), Longyearbyen,Svalbard,Norway, July 6-12, 1997.

M.G.Parker and M.Benaissa, Fault-Tolerant Linear Convolution using Residue Number Systems [pdf, postscript]. Proc of ISCAS '94, London, Vol 2, pp 441-445, May 1994.

M.G.Parker and M.Benaissa, Using Redundant Number Representations for Efficient VLSI Implementation of Modular Arithmetic, [pdf, postscript] Proc of IEE Coll on "Synthesis and Optimisation of Logic Systems", (E3,E10), Savoy Place, London, 14th Mar, 1994, Digest No: 1994/066.

M.G.Parker and M.Benaissa, Bit-Serial, VLSI Architecture for the Implementation of Maximum-Length Number-Theoretic Transforms Using Mixed Basis Representations, [pdf, postscript] Proc of ICASSP '93, Minneapolis, Vol I, pp 341-344, April 1993.

M.G.Parker and M.Benaissa, A Bit-Serial, VLSI Implementation of a 60-Point NTT Using Binary and Ternary Bases, Digest of Int Symp on DSP for Communication Systems, Univ of Warwick 7-9th Sept 1992.

Conference Papers Submitted

None at the moment.

Invited Talks

Matthew G. Parker, Aperiodic properties of Boolean functions, Invited talk at Enhancing Crypto-Primitives with Techniques from Coding Theory, NATO Advanced Research Workshop, Veliko Tarnovo, Bulgaria, 6-9 October 2008.

Matthew G. Parker, Close encounters with Boolean functions of three different kinds, [pdf] Invited talk at 2nd International Castle Meeting on Coding Theory and Applications, 2ICMCTA, Castillo de la Mota. Medina del Campo (Valladolid), to be published in Lecture Notes in Computer Science(LNCS), 15-19 September 2008.

Matthew G. Parker and Alexander Pott, On Boolean functions which are bent and negabent, [pdf, postscript], Invited talk at Sequences, Subsequences, and (their) Consequences, University of Southern California, May 31 - June 2, 2007. Talk given by Prof. Alexander Pott.

M. G. Parker, Spectrally Bounded Sequences, Codes and States: Graph Constructions and Entanglement [pdf, postscript], Invited Talk at Eighth IMA International Conference on Cryptography and Coding, Cirencester, UK, 17-19 December, 2001, LNCS 2260, pp. 339 --, (2001), Copyright Springer-Verlag

Matthew G. Parker, Univariate and Multivariate Merit Factors, [pdf, postscript], SETA04 - Sequences and their Applications, Seoul, South Korea, October 2004.

Chapters in Books

Tor E. Bjørstad and Matthew G. Parker, Equivalence Between Certain Complementary Pairs of Types I and III, [pdf] in Enhancing Cryptographic Primitives with Techniques from Error Correcting Codes, Volume 23, NATO Science for Peace and Security Series - D: Information and Communication Security, Edited by: B. Preneel, S. Dodunekov, V. Rijmen and S. Nikova, June 2009.

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

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.

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

Editor of Books

Editors: Solomon W. Golomb, Matthew G. Parker, A. Pott, A. Winterhof, Sequences and Their Applications - SETA 2008, University of Kentucky, Lexington, KY, Lecture Notes in Computer Science, LNCS 5203, Sept. 14-18, 2008.

Posters

C. Riera and Matthew G. Parker, A Generalisation of Graph States to Two-Graph States, International Workshop on Measurement-Based Quantum Computing, Oxford, 18-21 March 2007.

Other Conference Papers (Unrefereed)

M.G. Parker, The Non-Alignment Properties of BPSK Sequences with Good Peak Factor [pdf, postscript] European Cooperation in the Field of Scientific and Technical Research, EURO-COST, COST 259 TD(00) 048, Bergen, Norway, 27-28 April 2000.

Technical Reports

Constanza Riera and Lars Eirik Danielsen and Matthew G. Parker, On Pivot Orbits of Boolean Functions, arXiv:math/0604396v1 [math.CO], April 2006.

L.E. Danielsen, T.A. Gulliver and M.G. Parker, Aperiodic Propagation Criteria for Boolean Functions, [pdf, postscript], ECRYPT Internal Document, STVL-UiB-1-APC-1.0, August 2004.

M.G.Parker and C.Tellambura A Construction for Binary Sequence Sets with Low Peak-to-Average Power Ratio, [pdf, postscript] Reports in Informatics, University of Bergen, Report No 242, ISSN 0333-3590, February 2003.

M.G.Parker, Generalised S-Box Nonlinearity, [pdf, postscript] NESSIE Public Document, 11.02.03: NES/DOC/UIB/WP5/020/A

Internal Reports

M.G.Parker and H.Raddum, Z4-Linear Cryptanalysis, NESSIE Internal Report, 27/06/2002: NES/DOC/UIB/WP5/018/1.

M.G.Parker, Z2 and Z4-Linear Subspace Approximations, NESSIE Internal Report, 29/06/2002: NES/DOC/UIB/WP5/019/A.

M.G.Parker, Complete Linear Cryptanalysis, NESSIE Internal Report, 16/08/2002: NES/DOC/UIB/WP5/021/A.

M.G.Parker,S.J.Shepherd and S.K.Barton, Final Report of EPSRC Grant GR/K48914: Multi-Function Coding for Minimisation of Peak Envelope Power and Error Control in Multitone Modulation Systems, University of Bradford Internal Report No 601, 1997.

M.G.Parker,S.J.Shepherd and S.K.Barton, Multi-Function Coding for Minimisation of Peak Envelope Power and Error Control in Multitone Modulation Systems, 2nd Annual Conference of the Communications Signal Processing and Coding Programme (EPSRC), Sheffield, 22/23 Jan, 1997.

M.G.Parker and M.Benaissa, VLSI Algorithms and Architectures for NTT-Based Systems and Applications, Internal Report, Huddersfield University, U.K., Feb 1993.

Supervisor for the Following PhD Theses

Lars Eirik Danielsen, On Connections Between Graphs, Codes, Quantum States, and Boolean Functions, [pdf], PhD thesis, Dept. Informat., Univ. Bergen, Norway, May 2008.

Constanza Riera Burger, Spectral Properties of Boolean functions, Graphs and Graph States, [pdf, Errata: pdf], Doctoral Thesis, submitted October, 2005, defended January 2006 - co-supervisor, Ignacio Luengo Velasco, Universidad Complutense de Madrid.

Supervisor for the Following Masters Theses

Mohamed Ahmed A. M. A. Abdelraheem, A Database for Boolean Functions and Constructions of Generalized Complementary Pairs, Master's Thesis, June, 2008.

Michael Mortensen, Secret Sharing and Secure Multi-party Computation, Master's Thesis, July, 2007.

Halvor Utby, A Survey on Turbo Codes and Recent Developments, Master's Thesis, Dec., 2006.

Svein Bjarte Aasestøl, On the Structure of Low Autocorrelation Binary Sequences, Master's Thesis, Dec., 2005.

Joakim Grahl Knudsen, Randomised Construction and Dynamic Decoding of LDPC Codes, [pdf, postscript], Master's Thesis, November, 2005.

D.Storøy, On Boolean Functions, Unitary Transforms, and Recursions, Master's Thesis, July, 2005.

L.E.Danielsen, On Self-Dual Quantum Codes, Graphs, and Boolean Functions Master's Thesis, March, 2005.

R.A.Kristiansen, On the Aperiodic Autocorrelation of Binary Sequences, [pdf, postscript], Master's Thesis, March 7, 2003.


Other Pictures
Database of Pivot Orbits
Database of Bipartite Pivot Orbits
Technical Reports for Inst. of Informatics

My PhD Thesis

M.G.Parker, VLSI Algorithms and Architectures for the Implementation of Number-Theoretic Transforms, Residue and Polynomial Residue Number Systems, PhD thesis, awarded by the School of Eng, University of Huddersfield, U.K., July 1995.

Manuscripts

Constanza Riera, Lars Eirik Danielsen, and Matthew G. Parker, On Pivot Orbits of Boolean functions, [pdf, postscript], preprint at: math.CO/0604396. April 2006.

Constanza Riera, George Petrides and Matthew G. Parker, Generalised Bent Criteria for Boolean Functions (II), [pdf, postscript] Also at: cs.IT/0502050.

M.G.Parker, A Mapping From Length n Binary Linear Block Codes to Length 2^n Bipolar Bent and Almost Bent Sequences [pdf, postscript], 2000.

M.G.Parker, A Modified Jacobi Sequence Construction Using Multi-Rate Legendre Sequences [pdf, postscript], 2000.

M.G.Parker, Legendre and Twin Prime Sequences: Trace and Multi-Rate Representations [pdf, postscript], 1999.

M.G.Parker and C.Tellambura, Golay-Davis-Jedwab Complementary Sequences and Rudin-Shapiro Constructions [pdf, postscript], 2001.

Papers in Preparation

Basis Converters for Generalised Redundant Number Representations, In Preparation

Special Cases of Montgomery's Algorithm, In Preparation


INF349 LECTURE COURSE ON QUANTUM COMPUTATION AND QUANTUM INFORMATION THEORY, Spring 2008

Useful Links
The Online Database of Boolean Functions
Lars Eirik Danielsen's Webpage with links to a Database of Stabilizer Quantum Codes, databases of local complementation and pivot orbits, and other things
Markus Grassl's Code Tables: Bounds on the parameters of various types of codes
Neil Sloane's Integer Sequence Database
Combinatorial Data (Brendan Mackay)
Combinatorial Catalogues (Gordon Royle)
Arnt Flatmo's site for mountains in Hordaland, Sogn og Fjordane and Møre og Romsdal (Norway)
QUANTIKI
Quantum Physics WIKI
WIKI
IEEE/IEE Digital Library
ECRYPT internal web pages
Weekly video quantum information seminars at Imperial
msri video lectures
Quantum Information and Computation
Useful Quantum Links
Ian Glendinning's Quantum Links
Electronic Journal of Combinatorics
Theory of Computing
Useful maps for town and street navigation
Aftenposten news
BIBSYS
Some real-time pictures of Bergen
Quantum Physics Preprint Site
Information Theory Preprint Site
Virtual Journal of Quantum Information
Math-Sci-Net
Lecture Notes in Computer Science
New Scientist
Nature
PhD Comics
Time Zones
Int. Dialing Codes
Centre for Quantum Computation
Qubit News
Last updated 15.02.08.