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.

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

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

Chapter in book

• Gadouleau, M. (2012). Random Network Coding and Matroids. In K. Al Agha (Ed.), Network coding (147-184). John Wiley and Sons

Conference Paper

• Castillo-Ramirez, A., & Gadouleau, M. (2016). On Finite Monoids of Cellular Automata. In M. Cook, & T. Neary (Eds.), Cellular automata and discrete complex systems : 22nd IFIP WG 1.5 International Workshop, AUTOMATA 2016, Zurich, Switzerland, June 15-17, 2016. Proceedings (90-104). https://doi.org/10.1007/978-3-319-39300-1_8
• Zeh, A., Wachter-Zeh, A., Gadouleau, M., & Bezzateev, S. (2013). Generalizing Bounds on the Minimum Distance of Cyclic Codes Using Cyclic Product Codes. In International Symposium on Information Theory Proceedings (ISIT 2013), 7-12 July 2013, Istanbul, Turkey ; proceedings (126-130). https://doi.org/10.1109/isit.2013.6620201
• Riis, S., & Gadouleau, M. (2011). A Dispersion Theorem for Communication Networks Based on Term Sets.
• Gadouleau, M., & Riis, S. (2011). Max-Flow Min-Cut Theorem for Rényi Entropy in Communication Networks.
• Riis, S., & Gadouleau, M. (2011). Network Coding Theorem for Dynamic Communication Networks.
• Gadouleau, M., & Goupil, A. (2010). Binary Codes for Packet Error and Packet Loss Correction in Store and Forward. In Proc. International ITG Conference on Source and Channel Coding (1-6)
• Gadouleau, M., & Yan, Z. (2009). On the Decoder Error Probability of Bounded Rank Distance Decoders for Rank Metric Codes.
• Gadouleau, M., & Yan, Z. (2009). Decoder Error Probability of Bounded Distance Decoders for Constant-Dimension Codes.
• Chen, N., Gadouleau, M., & Yan, Z. (2009). Rank Metric Decoder Architectures for Noncoherent Error Control in Random Network Coding.
• Gadouleau, M., & Yan, Z. (2009). Packing and Covering Properties of Subspace Codes.
• Gadouleau, M., & Yan, Z. (2009). Construction and Covering Properties of Constant-Dimension Codes.
• Gadouleau, M., & Yan, Z. (2008). Constant-Rank Codes.
• Gadouleau, M., & Yan, Z. (2008). Constant-Rank Codes and Their Connection to Constant-Dimension Codes.
• Gadouleau, M., & Yan, Z. (2008). Complexity of Decoding Gabidulin Codes. In Proc. IEEE CISS (1081-1085)
• Gadouleau, M., & Yan, Z. (2007). Covering Properties of Rank Metric Codes.
• Gadouleau, M., & Yan, Z. (2007). MacWilliams Identity for the Rank Metric.
• Gadouleau, M., & Yan, Z. (2006). Properties of Codes with the Rank Metric. In Proc. IEEE Globecom (1-5)
• Gadouleau, M., & Yan, Z. (2006). Decoder Error Probability of MRD Codes. In Proc. IEEE Information Theory Workshop (264-268)
• Gadouleau, M., & Yan, Z. (2006). Security of the GPT-Type Cryptosystems.
• Gadouleau, M., & Yan, Z. (2005). A Private-Key Cryptosystem Based on the Rank Metric. In Proc. Algebraic Methods in Cryptography Workshop
• Gadouleau, M., & Yan, Z. (2005). Optimal Distortion Parameter for the GPT Public-Key Cryptosystem. In Proc. IEEE Sarnoff Symposium (130-133)

Journal Article

• Gadouleau, M., Harms, N., Mertzios, G. B., & Zamaraev, V. (2024). Graphs with minimum fractional domatic number. Discrete Applied Mathematics, 343, 140-148. https://doi.org/10.1016/j.dam.2023.10.020
• Gadouleau, M., Mariot, L., & Picek, S. (2023). Bent functions in the partial spread class generated by linear recurring sequences. Designs, Codes and Cryptography, 91(1), 63-82. https://doi.org/10.1007/s10623-022-01097-1
• Bridoux, F., Gadouleau, M., & Theyssier, G. (2020). Expansive automata networks. Theoretical Computer Science, 843, 25-44. https://doi.org/10.1016/j.tcs.2020.06.019
• Castillo-Ramirez, A., & Gadouleau, M. (2020). Elementary, finite and linear vN-regular cellular automata. Information and Computation, 274, Article 104533. https://doi.org/10.1016/j.ic.2020.104533
• Aracena, J., Gadouleau, M., Richard, A., & Salinas, L. (2020). Fixing monotone Boolean networks asynchronously. Information and Computation, Article 104540. https://doi.org/10.1016/j.ic.2020.104540
• Bridoux, F., Castillo-Ramirez, A., & Gadouleau, M. (2020). Complete Simulation of Automata Networks. Journal of Computer and System Sciences, 109, 1-21. https://doi.org/10.1016/j.jcss.2019.12.001
• Riis, S., & Gadouleau, M. (2019). Max-flow min-cut theorems on dispersion and entropy measures for communication networks. Information and Computation, 267, 49-73. https://doi.org/10.1016/j.ic.2019.03.004
• Gadouleau, M. (2019). On the stability and instability of finite dynamical systems with prescribed interaction graphs. Electronic Journal of Combinatorics, 26(3), Article P3.32
• Gadouleau, M. (2018). On the Rank and Periodic Rank of Finite Dynamical Systems. Electronic Journal of Combinatorics, 25(3), Article #P3.48
• Gadouleau, M. (2018). Finite Dynamical Systems, Hat Games, and Coding Theory. SIAM Journal on Discrete Mathematics, 32(3), 1922-1945. https://doi.org/10.1137/15m1044758
• Gadouleau, M. (2018). On the possible values of the entropy of undirected graphs. Journal of Graph Theory, 88(2), 302-311. https://doi.org/10.1002/jgt.22213
• Cameron, P. J., Gadouleau, M., Mitchell, J. D., & Peresse, Y. (2017). Chains of subsemigroups. Israel Journal of Mathematics, 220(1), 479-508. https://doi.org/10.1007/s11856-017-1523-x
• Cameron, P. J., Castillo-Ramirez, A., Gadouleau, M., & Mitchell, J. D. (2017). Lengths of words in transformation semigroups generated by digraphs. Journal of Algebraic Combinatorics, 45(1), 149-170. https://doi.org/10.1007/s10801-016-0703-9
• Castillo-Ramirez, A., & Gadouleau, M. (2016). Ranks of finite semigroups of one-dimensional cellular automata. Semigroup Forum, 93(2), 347-362. https://doi.org/10.1007/s00233-016-9783-z
• Gadouleau, M., Richard, A., & Fanchon, E. (2016). Reduction and Fixed Points of Boolean Networks and Linear Network Coding Solvability. IEEE Transactions on Information Theory, 62(5), 2504-2519. https://doi.org/10.1109/tit.2016.2544344
• Gadouleau, M., & Richard, A. (2016). Simple dynamics on graphs. Theoretical Computer Science, 628, 62-77. https://doi.org/10.1016/j.tcs.2016.03.013
• Gadouleau, M., Richard, A., & Riis, S. (2015). Fixed points of Boolean networks, guessing graphs, and coding theory. SIAM Journal on Discrete Mathematics, 29(4), 2312-2335. https://doi.org/10.1137/140988358
• Gadouleau, M., & Georgiou, N. (2015). New Constructions and Bounds for Winkler's Hat Game. SIAM Journal on Discrete Mathematics, 29(2), 823-834. https://doi.org/10.1137/130944680
• Gadouleau, M., & Riis, S. (2015). Memoryless computation: New results, constructions, and extensions. Theoretical Computer Science, 562, 129-145. https://doi.org/10.1016/j.tcs.2014.09.040
• Cameron, P., Fairbairn, B., & Gadouleau, M. (2014). Computing in Permutation Groups Without Memory. Chicago journal of theoretical computer science, 2014(7), 1-20. https://doi.org/10.4086/cjtcs.2014.007
• Cameron, P., Fairbairn, B., & Gadouleau, M. (2014). Computing in Matrix Groups Without Memory. Chicago journal of theoretical computer science, 2014(8), 1-16. https://doi.org/10.4086/cjtcs.2014.008
• Gadouleau, M. (2014). Entropy of Closure Operators and Network Coding Solvability. Entropy, 16(9), 5122-5143. https://doi.org/10.3390/e16095122
• Gadouleau, M. (2013). Closure Solvability for Network Coding and Secret Sharing. IEEE Transactions on Information Theory, 59(12), 7858-7869. https://doi.org/10.1109/tit.2013.2282293
• Cameron, P. J., Gadouleau, M., & Riis, S. (2013). Combinatorial Representations. Journal of Combinatorial Theory, Series A, 120(3), 671-682. https://doi.org/10.1016/j.jcta.2012.12.002
• Cameron, P. J., & Gadouleau, M. (2012). Remoteness of permutation codes. European Journal of Combinatorics, 33(6), 1273-1285. https://doi.org/10.1016/j.ejc.2012.03.027
• Chen, N., Yan, Z., Gadouleau, M., Wang, Y., & Suter, B. 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. https://doi.org/10.1109/tvlsi.2010.2096239
• Gadouleau, M., & Riis, S. (2011). Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications. IEEE Transactions on Information Theory, 57(10), 6703-6717. https://doi.org/10.1109/tit.2011.2155618
• Gadouleau, M., & Goupil, A. (2011). A Matroid Framework for Noncoherent Random Network Communications. IEEE Transactions on Information Theory, 57(2), 1031-1045. https://doi.org/10.1109/tit.2010.2094818
• Gadouleau, M., & Yan, Z. (2010). Constant-Rank Codes and Their Connection to Constant-Dimension Codes. IEEE Transactions on Information Theory, 56(7), 3207-3216. https://doi.org/10.1109/tit.2010.2048447
• Gadouleau, M., & Yan, Z. (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, M., & Yan, Z. (2009). Bounds on Covering Codes with the Rank Metric. IEEE Communications Letters, 13(9), 691-693
• Gadouleau, M., & Yan, Z. (2008). Packing and Covering Properties of Rank Metric Codes. IEEE Transactions on Information Theory, 54(9), 3873-3883. https://doi.org/10.1109/tit.2008.928284
• Gadouleau, M., & Yan, Z. (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, M., & Yan, Z. (2008). MacWilliams Identity for Codes with the Rank Metric. EURASIP Journal on Wireless Communications and Networking, 2008, Article 754021. https://doi.org/10.1155/2008/754021