Staff profile

Personal webpage

I am an Associate Professor in Computer Science in the Algorithms and Complexity group.

I received my MSc and PhD in Computer Engineering from Lehigh University in December 2005 and May 2009, respectively. After graduation, I held a postdoctoral research position in Université de Reims Champagne-Ardenne, France until May 2010. I then was a postdoctoral research assistant in the Theoretical Computer Science group at Queen Mary, University of London until December 2011. I moved to Durham on January 2012.

I am a member of the IEEE and the IEEE Information Theory Society and of the London Mathematical Society.

My research interests include coding theory, network coding and information theory. I study their connection to other branches of mathematics, such as combinatorics, graph theory, discrete optimisation, matroid theory, logic and group theory. I also investigate their possible application to network design, data storage, cryptography, data compression and more recently computation models.

• Coding theory
• Information theory
• Boolean networks
• Combinatorics
• Semigroups

• ACiD: Algorithms and Complexity

• 2018: Carnegie Trust for the Universities of Scotland: Research Assessor:
• 2017: EPSRC Peer Review College member:

Chapter in book

• Gadouleau, Maximilien (2012). Random Network Coding and Matroids. In Network Coding. Al Agha, Khaldoun London: John Wiley & Sons. 147-184.

Conference Paper

• Castillo-Ramirez, Alonso & Gadouleau, Maximilien (2016), On Finite Monoids of Cellular Automata, in Cook, Matthew & Neary, Turlough eds, Lecture Notes in Computer Science, 9664 International workshop on cellular automata and discrete complex systems. Zurich, Switzerland, Springer, 90-104.
• Zeh, Alexander, Wachter-Zeh, Antonia, Gadouleau, Maximilien & Bezzateev, Sergey (2013), Generalizing Bounds on the Minimum Distance of Cyclic Codes Using Cyclic Product Codes, IEEE International Symposium on Information Theory 2013 IEEE International Symposium on Information Theory. Istanbul, Turkey, IEEE, Istanbul, 126-130.
• Riis, Søren & Gadouleau, Maximilien (2011), Network Coding Theorem for Dynamic Communication Networks, IEEE International Symposium on Network Coding. Beijing, China, Beijing, 1-6.
• Gadouleau, Maximilien & Riis, Søren (2011), Max-Flow Min-Cut Theorem for Rényi Entropy in Communication Networks, IEEE International Symposium on Information Theory. St Petersburg, Russia, St Petersburg, 677-681.
• Riis, Søren & Gadouleau, Maximilien (2011), A Dispersion Theorem for Communication Networks Based on Term Sets, IEEE International Symposium on Information Theory. St Petersburg, Russia, St Petersburg, 667-671.
• Gadouleau, Maximilien & Goupil, Alban (2010), Binary Codes for Packet Error and Packet Loss Correction in Store and Forward, International ITG Conference on Source and Channel Coding. Siegen, Germany, Siegen, 1-6.
• Gadouleau, Maximilien & Yan, Zhiyuan (2009), Construction and Covering Properties of Constant-Dimension Codes, IEEE International Symposium on Information Theory. Seoul, South Korea, Seoul, 2221-2225.
• Gadouleau, Maximilien & Yan, Zhiyuan (2009), Packing and Covering Properties of Subspace Codes, IEEE International Symposium on Information Theory. Seoul, South Korea, Seoul, 2867-2871.
• Gadouleau, Maximilien & Yan, Zhiyuan (2009), Decoder Error Probability of Bounded Distance Decoders for Constant-Dimension Codes, IEEE International Symposium on Information Theory. Seoul, South Korea, Seoul, 2226-2230.
• Chen, Ning, Gadouleau, Maximilien & Yan, Zhiyuan (2009), Rank Metric Decoder Architectures for Noncoherent Error Control in Random Network Coding, IEEE Workshop on Signal Processing Systems. Tampere, Finland, Tampere, 127-132.
• Gadouleau, Maximilien & Yan, Zhiyuan (2009), On the Decoder Error Probability of Bounded Rank Distance Decoders for Rank Metric Codes, IEEE Information Theory Workshop. Taormina, Italy, Taormina, 485-489.
• Gadouleau, Maximilien & Yan, Zhiyuan (2008), Constant-Rank Codes, IEEE ISIT. Toronto, ON, Toronto, 876-880.
• Gadouleau, Maximilien & Yan, Zhiyuan (2008), Complexity of Decoding Gabidulin Codes, CISS. Princeton, NJ, Princeton NJ, 1081-1085.
• Gadouleau, Maximilien & Yan, Zhiyuan (2008), Constant-Rank Codes and Their Connection to Constant-Dimension Codes, 2008 IEEE International Workshop on Wireless Network Coding (WiNC 2008). San Francisco, CA, 1-6.
• Gadouleau, Maximilien & Yan, Zhiyuan (2007), MacWilliams Identity for the Rank Metric, IEEE ISIT. Nice, France, Nice, 36-40.
• Gadouleau, Maximilien & Yan, Zhiyuan (2007), Covering Properties of Rank Metric Codes, IEEE Globecom. Washington, DC, Washington DC, 1446-1450.
• Gadouleau, Maximilien & Yan, Zhiyuan (2006), Decoder Error Probability of MRD Codes, IEE ITW. Chengdu. China, Chengdu, 264-268.
• Gadouleau, Maximilien & Yan, Zhiyuan (2006), Properties of Codes with the Rank Metric, IEEE Globecom. San Francisco, CA, San Francisco CA, 1-5.
• Gadouleau, Maximilien & Yan, Zhiyuan (2006), Security of the GPT-Type Cryptosystems, IEEE ISIT. Seattle, WA, Seattle WA, 724-728.
• Gadouleau, Maximilien & Yan, Zhiyuan (2005), A Private-Key Cryptosystem Based on the Rank Metric, Algebraic Methods in Cryptography Workshop. Beijing. China, Beijing.
• Gadouleau, Maximilien & Yan, Zhiyuan (2005), Optimal Distortion Parameter for the GPT Public-Key Cryptosystem, IEEE Sarnoff Symposium. Princeton, NJ, Princeton NJ, 130-133.

Journal Article

• Gadouleau, Maximilien, Mariot, Luca & Picek, Stjepan (2023). Bent functions in the partial spread class generated by linear recurring sequences. Designs, Codes and Cryptography 91(1): 63-82.
• Bridoux, Florian, Gadouleau, Maximilien & Theyssier, Guillaume (2020). Expansive automata networks. Theoretical Computer Science 843: 25-44.
• Aracena, Julio, Gadouleau, Maximilien, Richard, Adrien & Salinas, Lilian (2020). Fixing monotone Boolean networks asynchronously. Information and Computation 274: 104540.
• Castillo-Ramirez, Alonso & Gadouleau, Maximilien (2020). Elementary, finite and linear vN-regular cellular automata. Information and Computation 274: 104533.
• Bridoux, Florian, Castillo-Ramirez, Alonso & Gadouleau, Maximilien (2020). Complete Simulation of Automata Networks. Journal of Computer and System Sciences 109: 1-21.
• Gadouleau, M. (2019). On the stability and instability of finite dynamical systems with prescribed interaction graphs. The Electronic Journal of Combinatorics 26(3): P3.32.
• Riis, Søren & Gadouleau, Maximilien (2019). Max-flow min-cut theorems on dispersion and entropy measures for communication networks. Information and Computation 267: 49-73.
• Gadouleau, Maximilien (2018). On the Rank and Periodic Rank of Finite Dynamical Systems. The Electronic Journal of Combinatorics 25(3): #P3.48.
• Gadouleau, Maximilien (2018). Finite Dynamical Systems, Hat Games, and Coding Theory. SIAM Journal on Discrete Mathematics 32(3): 1922-1945.
• Gadouleau, Maximilien (2018). On the possible values of the entropy of undirected graphs. Journal of Graph Theory 88(2): 302-311.
• Cameron, Peter J., Gadouleau, Maximilien, Mitchell, James D. & Peresse, Yann (2017). Chains of subsemigroups. Israel Journal of Mathematics 220(1): 479-508.
• Cameron, Peter J., Castillo-Ramirez, Alonso, Gadouleau, Maximilien & Mitchell, James D. (2017). Lengths of words in transformation semigroups generated by digraphs. Journal of Algebraic Combinatorics 45(1): 149-170.
• Gadouleau, Maximilien, Richard, Adrien & Fanchon, Eric (2016). Reduction and Fixed Points of Boolean Networks and Linear Network Coding Solvability. IEEE Transactions on Information Theory 62(5): 2504-2519.
• Gadouleau, Maximilien & Richard, Adrien (2016). Simple dynamics on graphs. Theoretical Computer Science 628: 62-77.
• Castillo-Ramirez, Alonso & Gadouleau, Maximilien (2016). Ranks of finite semigroups of one-dimensional cellular automata. Semigroup Forum 93(2): 347-362.
• Gadouleau, Maximilien, Richard, Adrien & Riis, Søren (2015). Fixed points of Boolean networks, guessing graphs, and coding theory. SIAM Journal on Discrete Mathematics 29(4): 2312-2335.
• Gadouleau, Maximilien & Georgiou, Nicholas (2015). New Constructions and Bounds for Winkler's Hat Game. SIAM Journal on Discrete Mathematics 29(2): 823-834.
• Gadouleau, Maximilien & Riis, Søren (2015). Memoryless computation: New results, constructions, and extensions. Theoretical Computer Science 562: 129-145.
• Gadouleau, Maximilien (2014). Entropy of Closure Operators and Network Coding Solvability. Entropy 16(9): 5122-5143.
• Cameron, Peter, Fairbairn, Ben & Gadouleau, Maximilien (2014). Computing in Permutation Groups Without Memory. Chicago Journal of Theoretical Computer Science 2014: 7, 1-20.
• Cameron, Peter, Fairbairn, Ben & Gadouleau, Maximilien (2014). Computing in Matrix Groups Without Memory. Chicago Journal of Theoretical Computer Science 2014: 8, 1-16.
• Gadouleau, Maximilien (2013). Closure Solvability for Network Coding and Secret Sharing. IEEE Transactions on Information Theory 59(12): 7858-7869.
• Cameron, Peter J., Gadouleau, Maximilien & Riis, Søren (2013). Combinatorial Representations. Journal of Combinatorial Theory, Series A 120(3): 671-682.
• Cameron, Peter J. & Gadouleau, Maximilien (2012). Remoteness of permutation codes. European Journal of Combinatorics 33(6): 1273-1285.
• Chen, Ning, Yan, Zhiyuan, Gadouleau, Maximilien, Wang, Ying & Suter, Bruce W. (2012). Rank Metric Decoder Architectures for Random Linear Network Coding with Error Control. IEEE Transactions on Very Large Scale Integration (VLSI) Systems 20(2): 296-309.
• Gadouleau, Maximilien & Goupil, Alban (2011). A Matroid Framework for Noncoherent Random Network Communications. IEEE Transactions on Information Theory 57(2): 1031-1045.
• Gadouleau, Maximilien & Riis, Soren (2011). Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications. IEEE Transactions on Information Theory 57(10): 6703-6717.
• Gadouleau, Maximilien & Yan, Zhiyuan (2010). Packing and Covering Properties of Subspace Codes for Error Control in Random Linear Network Coding. IEEE Transactions on Information Theory 56(5): 2097-2108.
• Gadouleau, Maximilien & Yan, Zhiyuan (2010). Constant-Rank Codes and Their Connection to Constant-Dimension Codes. IEEE Transactions on Information Theory 56(7): 3207-3216.
• Gadouleau, Maximilien & Yan, Zhiyuan (2009). Bounds on Covering Codes with the Rank Metric. IEEE Communications Letters 13(9): 691-693.
• Gadouleau, Maximilien & Yan, Zhiyuan (2008). On the Decoder Error Probability of Bounded Rank-Distance Decoders for Maximum Rank Distance Codes. IEEE Transactions on Information Theory 54(7): 3202-3206.
• Gadouleau, Maximilien & Yan, Zhiyuan (2008). Packing and Covering Properties of Rank Metric Codes. IEEE Transactions on Information Theory 54(9): 3873-3883.
• Gadouleau, Maximilien & Yan, Zhiyuan (2008). MacWilliams Identity for Codes with the Rank Metric. EURASIP Journal on Wireless Communications and Networking 2008: 754021.