Properties of Codes with the Rank Metric. - Maximilien Gadouleau; Zhiyuan Yan 001 (GLOBECOM, 2006)

Security of the GPT-Type Cryptosystems. - Maximilien Gadouleau; Zhiyuan Yan 001 (ISIT, 2006)

Decoder Error Probability of MRD Codes - Maximilien Gadouleau; Zhiyuan Yan 001 (CoRR, 2006)

Error Performance Analysis of Maximum Rank Distance Codes - Maximilien Gadouleau; Zhiyuan Yan 001 (CoRR, 2006)

Covering Properties of Rank Metric Codes. - Maximilien Gadouleau; Zhiyuan Yan 001 (GLOBECOM, 2007)

MacWilliams Identity for the Rank Metric. - Maximilien Gadouleau; Zhiyuan Yan 001 (ISIT, 2007)

MacWilliams Identity for Codes with the Hamming and Rank Metrics - Maximilien Gadouleau; Zhiyuan Yan 001 (CoRR, 2007)

Properties of Rank Metric Codes - Maximilien Gadouleau; Zhiyuan Yan 001 (CoRR, 2007)

Complexity of decoding Gabidulin codes. - Maximilien Gadouleau; Zhiyuan Yan 001 (CISS, 2008)

Constant-rank codes. - Maximilien Gadouleau; Zhiyuan Yan 001 (ISIT, 2008)

On the Connection between Optimal Constant-Rank Codes and Optimal Constant-Dimension Codes - Maximilien Gadouleau; Zhiyuan Yan 001 (CoRR, 2008)

Packing and Covering Properties of CDCs and Subspace Codes - Maximilien Gadouleau; Zhiyuan Yan 001 (CoRR, 2008)

On the Decoder Error Probability of Rank Metric Codes and Constant-Dimension Codes - Maximilien Gadouleau; Zhiyuan Yan 001 (CoRR, 2008)

MacWilliams Identity for Codes with the Rank Metric. - Maximilien Gadouleau; Zhiyuan Yan 001 (EURASIP J. Wirel. Commun. Netw., 2008)

On the Decoder Error Probability of Bounded Rank-Distance Decoders for Maximum RankDistance Codes. - Maximilien Gadouleau; Zhiyuan Yan 001 (IEEE Trans. Inf. Theory, 2008)

Packing and Covering Properties of Rank Metric Codes. - Maximilien Gadouleau; Zhiyuan Yan 001 (IEEE Trans. Inf. Theory, 2008)

Construction and covering properties of constant-dimension codes. - Maximilien Gadouleau; Zhiyuan Yan 001 (ISIT, 2009)

Decoder error probability of bounded distance decoders for constant-dimension codes. - Maximilien Gadouleau; Zhiyuan Yan 001 (ISIT, 2009)

Packing and covering properties of subspace codes. - Maximilien Gadouleau; Zhiyuan Yan 001 (ISIT, 2009)

Rank metric decoder architectures for noncoherent error control in random network coding. - Ning Chen 004; Maximilien Gadouleau; Zhiyuan Yan 001 (SiPS, 2009)

Bounds on covering codes with the rank metric. - Maximilien Gadouleau; Zhiyuan Yan 001 (IEEE Commun. Lett., 2009)

Max-Flow Min-Cut Theorems for Communication Networks Based on Equational Logic - Maximilien Gadouleau; Søren Riis (CoRR, 2010)

Packing and covering properties of subspace codes for error control in random linear network coding. - Maximilien Gadouleau; Zhiyuan Yan 001 (IEEE Trans. Inf. Theory, 2010)

Constant-rank codes and their connection to constant-dimension codes. - Maximilien Gadouleau; Zhiyuan Yan 001 (IEEE Trans. Inf. Theory, 2010)

Max-flow min-cut theorem for Rényi entropy in communication networks. - Maximilien Gadouleau; Søren Riis (ISIT, 2011)

A dispersion theorem for communication networks based on term sets. - Søren Riis; Maximilien Gadouleau (ISIT, 2011)

Computing without memory - Maximilien Gadouleau; Søren Riis (CoRR, 2011)

A Matroid Framework for Noncoherent Random Network Communications. - Maximilien Gadouleau; Alban Goupil (IEEE Trans. Inf. Theory, 2011)

Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications. - Maximilien Gadouleau; Søren Riis (IEEE Trans. Inf. Theory, 2011)

Closure solvability for network coding - Maximilien Gadouleau (CoRR, 2012)

Remoteness of permutation codes. - Peter J. Cameron; Maximilien Gadouleau (Eur. J. Comb., 2012)

Rank Metric Decoder Architectures for Random Linear Network Coding With Error Control. - Ning Chen 004; Zhiyuan Yan 001; Maximilien Gadouleau; Ying Wang; Bruce W. Suter (IEEE Trans. Very Large Scale Integr. Syst., 2012)

Generalizing bounds on the minimum distance of cyclic codes using cyclic product codes. - Alexander Zeh; Antonia Wachter-Zeh; Maximilien Gadouleau; Sergey Bezzateev (ISIT, 2013)

Entropy of Closure Operators. - Maximilien Gadouleau (CoRR, 2013)

Lexicographic identifying codes - Maximilien Gadouleau (CoRR, 2013)

Combinatorial representations. - Peter J. Cameron; Maximilien Gadouleau; Søren Riis (J. Comb. Theory A, 2013)

Closure Solvability for Network Coding and Secret Sharing. - Maximilien Gadouleau (IEEE Trans. Inf. Theory, 2013)

Computing in Permutation Groups Without Memory. - Peter J. Cameron; Ben Fairbairn; Maximilien Gadouleau (Chic. J. Theor. Comput. Sci., 2014)

Computing in Matrix Groups Without Memory. - Peter J. Cameron; Ben Fairbairn; Maximilien Gadouleau (Chic. J. Theor. Comput. Sci., 2014)

Entropy of Closure Operators and Network Coding Solvability. - Maximilien Gadouleau (Entropy, 2014)

Universal Simulation of Automata Networks. - Alonso Castillo-Ramirez; Maximilien Gadouleau (CoRR, 2015)

Maximum Rank and Asymptotic Rank of Finite Dynamical Systems. - Maximilien Gadouleau (CoRR, 2015)

New Constructions and Bounds for Winkler's Hat Game. - Maximilien Gadouleau; Nicholas Georgiou (SIAM J. Discret. Math., 2015)

Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory. - Maximilien Gadouleau; Adrien Richard; Søren Riis (SIAM J. Discret. Math., 2015)

Memoryless computation: New results, constructions, and extensions. - Maximilien Gadouleau; Søren Riis (Theor. Comput. Sci., 2015)

On Finite Monoids of Cellular Automata. - Alonso Castillo-Ramirez; Maximilien Gadouleau (Automata, 2016)

Simple dynamics on graphs. - Maximilien Gadouleau; Adrien Richard (Theor. Comput. Sci., 2016)

Reduction and Fixed Points of Boolean Networks and Linear Network Coding Solvability. - Maximilien Gadouleau; Adrien Richard; Eric Fanchon (IEEE Trans. Inf. Theory, 2016)

Von Neumann Regular Cellular Automata. - Alonso Castillo-Ramirez; Maximilien Gadouleau (AUTOMATA, 2017)

Constant-Weight Array Codes. - Maximilien Gadouleau (CoRR, 2017)

On Fixable Families of Boolean Networks. - Maximilien Gadouleau; Adrien Richard (ACRI, 2018)

On the Rank and Periodic Rank of Finite Dynamical Systems. - Maximilien Gadouleau (Electron. J. Comb., 2018)

On the possible values of the entropy of undirected graphs. - Maximilien Gadouleau (J. Graph Theory, 2018)

Finite Dynamical Systems, Hat Games, and Coding Theory. - Maximilien Gadouleau (SIAM J. Discret. Math., 2018)

On the Stability and Instability of Finite Dynamical Systems with Prescribed Interaction Graphs. - Maximilien Gadouleau (Electron. J. Comb., 2019)

Linear Programming complementation and its application to fractional graph theory. - Maximilien Gadouleau; George B. Mertzios; Viktor Zamaraev (CoRR, 2019)

Max-flow min-cut theorems on dispersion and entropy measures for communication networks. - Søren Riis; Maximilien Gadouleau (Inf. Comput., 2019)

Cellular automata and finite groups. - Alonso Castillo-Ramirez; Maximilien Gadouleau (Nat. Comput., 2019)

Commutative Automata Networks. - Florian Bridoux; Maximilien Gadouleau; Guillaume Theyssier (Automata, 2020)

Latin Hypercubes and Cellular Automata. - Maximilien Gadouleau; Luca Mariot (Automata, 2020)

On Simulation in Automata Networks. - Florian Bridoux; Maximilien Gadouleau; Guillaume Theyssier (CiE, 2020)

Grover's Algorithm and Many-Valued Quantum Logic. - Samuel E. Hunt; Maximilien Gadouleau (CoRR, 2020)

Mutually orthogonal latin squares based on cellular automata. - Luca Mariot; Maximilien Gadouleau; Enrico Formenti; Alberto Leporati (Des. Codes Cryptogr., 2020)

Bent Functions from Cellular Automata. - Maximilien Gadouleau; Luca Mariot; Stjepan Picek (IACR Cryptol. ePrint Arch., 2020)

Fixing monotone Boolean networks asynchronously. - Julio Aracena; Maximilien Gadouleau; Adrien Richard; Lilian Salinas (Inf. Comput., 2020)

Elementary, finite and linear vN-regular cellular automata. - Alonso Castillo-Ramirez; Maximilien Gadouleau (Inf. Comput., 2020)

Complete simulation of automata networks. - Florian Bridoux; Alonso Castillo-Ramirez; Maximilien Gadouleau (J. Comput. Syst. Sci., 2020)

On the influence of the interaction graph on a finite dynamical system. - Maximilien Gadouleau (Nat. Comput., 2020)

Expansive automata networks. - Florian Bridoux; Maximilien Gadouleau; Guillaume Theyssier (Theor. Comput. Sci., 2020)

Dynamical Properties of Disjunctive Boolean Networks (Invited Talk). - Maximilien Gadouleau (AUTOMATA, 2021)

Preface. - Konrad K. Dabrowski; Maximilien Gadouleau; Nicholas Georgiou; Matthew Johnson 002; George B. Mertzios; Daniël Paulusma (BCC, 2021)

The maximum discrete surface-to-volume ratio of space-filling curve partitions. - Maximilien Gadouleau; Tobias Weinzierl (CoRR, 2021)

Graphs with minimum degree-based entropy. - Yanni Dong; Maximilien Gadouleau; Pengfei Wan; Shenggui Zhang (CoRR, 2021)

Words fixing the kernel network and maximum independent sets in graphs. - Maximilien Gadouleau; David C. Kutner (CoRR, 2023)

Robert's theorem and graphs on complete lattices. - Maximilien Gadouleau (CoRR, 2023)

A New Centralized Multi-Node Repair Scheme of MSR codes with Error-Correcting Capability. - Shenghua Li; Maximilien Gadouleau; Jiaojiao Wang; Dabin Zheng (CoRR, 2023)

Bent functions in the partial spread class generated by linear recurring sequences. - Maximilien Gadouleau; Luca Mariot; Stjepan Picek (Des. Codes Cryptogr., 2023)

Bringing memory to Boolean networks: a unifying framework. - Maximilien Gadouleau; Loïc Paulevé; Sara Riva (CoRR, 2024)

On Maximal Families of Binary Polynomials with Pairwise Linear Common Factors. - Maximilien Gadouleau; Luca Mariot; Federico Mazzone (CoRR, 2024)

Graphs with minimum degree-entropy. - Yanni Dong; Maximilien Gadouleau; Pengfei Wan; Shenggui Zhang (Inf. Sci., 2024)

Factorisation in the semiring of finite dynamical systems. - Émile Naquin; Maximilien Gadouleau (Theor. Comput. Sci., 2024)

Graphs with minimum fractional domatic number. - Maximilien Gadouleau; Nathaniel Harms; George B. Mertzios; Viktor Zamaraev (Discret. Appl. Math., 2024)

Brief Announcement: Amnesiac Flooding: Easy to Break, Difficult to Escape. - Henry Austin; Maximilien Gadouleau; George B. Mertzios; Amitabh Trehan (PODC, 2025)

The MacWilliams identity for the skew rank metric. - Izzy Friedlander; Thanasis Bouganis; Maximilien Gadouleau (Adv. Math. Commun., 2025)

Generalising the maximum independent set algorithm via Boolean networks. - Maximilien Gadouleau; David C. Kutner (Inf. Comput., 2025)

Linear Programming complementation. - Maximilien Gadouleau; George B. Mertzios; Viktor Zamaraev (Theor. Comput. Sci., 2025)

Amnesiac Flooding: Easy to break, hard to escape. - Henry Austin; Maximilien Gadouleau; George B. Mertzios; Amitabh Trehan (CoRR, 2025)