Constant-rank codes and their connection to constant-dimension codes M Gadouleau, Z Yan Information Theory, IEEE Transactions on 56 (7), 3207-3216, 2010 | 82 | 2010 |
Graph-theoretical Constructions for Graph Entropy and Network Coding Based Communications M Gadouleau, S Riis Information Theory, IEEE Transactions on 57 (10), 6703-6717, 2011 | 71 | 2011 |
Packing and covering properties of rank metric codes M Gadouleau, Z Yan IEEE Transactions on Information Theory 54 (9), 3873-3883, 2008 | 59 | 2008 |
Packing and covering properties of subspace codes for error control in random linear network coding M Gadouleau, Z Yan Information Theory, IEEE Transactions on 56 (5), 2097-2108, 2010 | 53 | 2010 |
Properties of codes with the rank metric M Gadouleau, Z Yan IEEE Global Telecommunications Conference 2006, 1-5, 2006 | 47* | 2006 |
On the Decoder Error Probability of Bounded Rank-Distance Decoders for Maximum Rank Distance Codes M Gadouleau, Z Yan Information Theory, IEEE Transactions on 54 (7), 3202-3206, 2008 | 44* | 2008 |
Complexity of decoding Gabidulin codes M Gadouleau, Z Yan 2008 42nd Annual Conference on Information Sciences and Systems, 1081-1085, 2008 | 41 | 2008 |
Mutually orthogonal latin squares based on cellular automata L Mariot, M Gadouleau, E Formenti, A Leporati Designs, Codes and Cryptography 88 (2), 391-411, 2020 | 40 | 2020 |
New constructions and bounds for Winkler's hat game M Gadouleau, N Georgiou SIAM Journal on Discrete Mathematics 29 (2), 823-834, 2015 | 33 | 2015 |
Reduction and fixed points of boolean networks and linear network coding solvability M Gadouleau, A Richard, E Fanchon IEEE Transactions on Information Theory 62 (5), 2504-2519, 2016 | 31 | 2016 |
Fixed points of Boolean networks, guessing graphs, and coding theory M Gadouleau, A Richard, S Riis SIAM Journal on Discrete Mathematics 29 (4), 2312-2335, 2015 | 30 | 2015 |
Finite dynamical systems, hat games, and coding theory M Gadouleau SIAM Journal on Discrete Mathematics 32 (3), 1922-1945, 2018 | 25 | 2018 |
Memoryless computation: new results, constructions, and extensions M Gadouleau, S Riis Theoretical Computer Science 562, 129-145, 2015 | 25* | 2015 |
A matroid framework for noncoherent random network communications M Gadouleau, A Goupil IEEE Transactions on Information Theory 57 (2), 1031-1045, 2011 | 24 | 2011 |
On the influence of the interaction graph on a finite dynamical system M Gadouleau Natural Computing 19 (1), 15-28, 2020 | 23 | 2020 |
Binary codes for packet error and packet loss correction in store and forward M Gadouleau, A Goupil 2010 International ITG Conference on Source and Channel Coding (SCC), 1-6, 2010 | 21 | 2010 |
Bounds on covering codes with the rank metric M Gadouleau, Z Yan IEEE Communications Letters 13 (9), 691-693, 2009 | 21 | 2009 |
Construction and covering properties of constant-dimension codes M Gadouleau, Z Yan 2009 IEEE International Symposium on Information Theory, 2221-2225, 2009 | 20 | 2009 |
MacWilliams identity for codes with the rank metric M Gadouleau, Z Yan EURASIP Journal on Wireless Communications and Networking 2008, 15, 2008 | 20 | 2008 |
Cellular automata and finite groups A Castillo-Ramirez, M Gadouleau Natural Computing 18, 445-458, 2019 | 17 | 2019 |