Maximilien Gadouleau

George B. Mertzios

Viktor Zamaraev

Theor. Comput. Sci., 2025

Generalising the maximum independent set algorithm via Boolean networks.

[BibT_eX]

[DOI]

David C. Kutner

Inf. Comput., 2025

2024

Graphs with minimum fractional domatic number.

[BibT_eX]

[DOI]

Discret. Appl. Math., January, 2024

Factorisation in the semiring of finite dynamical systems.

[BibT_eX]

[DOI]

Émile Naquin

Theor. Comput. Sci., 2024

Graphs with minimum degree-entropy.

[BibT_eX]

[DOI]

Inf. Sci., 2024

On Maximal Families of Binary Polynomials with Pairwise Linear Common Factors.

[BibT_eX]

[DOI]

Federico Mazzone

CoRR, 2024

Bringing memory to Boolean networks: a unifying framework.

[BibT_eX]

[DOI]

Loïc Paulevé

Sara Riva

CoRR, 2024

2023

Bent functions in the partial spread class generated by linear recurring sequences.

[BibT_eX]

[DOI]

Stjepan Picek

Des. Codes Cryptogr., 2023

A New Centralized Multi-Node Repair Scheme of MSR codes with Error-Correcting Capability.

[BibT_eX]

[DOI]

CoRR, 2023

Robert's theorem and graphs on complete lattices.

[BibT_eX]

[DOI]

CoRR, 2023

Words fixing the kernel network and maximum independent sets in graphs.

[BibT_eX]

[DOI]

David C. Kutner

CoRR, 2023

2022

The MacWilliams Identity for the Skew Rank Metric.

[BibT_eX]

[DOI]

Izzy Friedlander

Thanasis Bouganis

CoRR, 2022

2021

Graphs with minimum degree-based entropy.

[BibT_eX]

[DOI]

CoRR, 2021

The maximum discrete surface-to-volume ratio of space-filling curve partitions.

[BibT_eX]

[DOI]

Tobias Weinzierl

CoRR, 2021

Preface.

[BibT_eX]

[DOI]

Proceedings of the Surveys in Combinatorics, 2021

Dynamical Properties of Disjunctive Boolean Networks (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 27th IFIP WG 1.5 International Workshop on Cellular Automata and Discrete Complex Systems, 2021

2020

Expansive automata networks.

[BibT_eX]

[DOI]

Guillaume Theyssier

Theor. Comput. Sci., 2020

On the influence of the interaction graph on a finite dynamical system.

[BibT_eX]

[DOI]

Nat. Comput., 2020

Complete simulation of automata networks.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2020

Elementary, finite and linear vN-regular cellular automata.

[BibT_eX]

[DOI]

Inf. Comput., 2020

Fixing monotone Boolean networks asynchronously.

[BibT_eX]

[DOI]

Inf. Comput., 2020

Bent Functions from Cellular Automata.

[BibT_eX]

[DOI]

Stjepan Picek

IACR Cryptol. ePrint Arch., 2020

Mutually orthogonal latin squares based on cellular automata.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2020

Grover's Algorithm and Many-Valued Quantum Logic.

[BibT_eX]

[DOI]

Samuel E. Hunt

CoRR, 2020

On Simulation in Automata Networks.

[BibT_eX]

[DOI]

Guillaume Theyssier

Proceedings of the Beyond the Horizon of Computability, 2020

Latin Hypercubes and Cellular Automata.

[BibT_eX]

[DOI]

Proceedings of the Cellular Automata and Discrete Complex Systems, 2020

Commutative Automata Networks.

[BibT_eX]

[DOI]

Guillaume Theyssier

Proceedings of the Cellular Automata and Discrete Complex Systems, 2020

2019

Cellular automata and finite groups.

[BibT_eX]

[DOI]

Nat. Comput., 2019

Max-flow min-cut theorems on dispersion and entropy measures for communication networks.

[BibT_eX]

[DOI]

Inf. Comput., 2019

Linear Programming complementation and its application to fractional graph theory.

[BibT_eX]

[DOI]

George B. Mertzios

Viktor Zamaraev

CoRR, 2019

On the Stability and Instability of Finite Dynamical Systems with Prescribed Interaction Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2019

2018

Finite Dynamical Systems, Hat Games, and Coding Theory.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

On the possible values of the entropy of undirected graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2018

On the Rank and Periodic Rank of Finite Dynamical Systems.

[BibT_eX]

[DOI]

Electron. J. Comb., 2018

On Fixable Families of Boolean Networks.

[BibT_eX]

[DOI]

Proceedings of the Cellular Automata, 2018

2017

Constant-Weight Array Codes.

[BibT_eX]

[DOI]

CoRR, 2017

Von Neumann Regular Cellular Automata.

[BibT_eX]

[DOI]

Proceedings of the Cellular Automata and Discrete Complex Systems, 2017

2016

Reduction and Fixed Points of Boolean Networks and Linear Network Coding Solvability.

[BibT_eX]

[DOI]

Eric Fanchon

IEEE Trans. Inf. Theory, 2016

Simple dynamics on graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

On Finite Monoids of Cellular Automata.

[BibT_eX]

[DOI]

Proceedings of the Cellular Automata and Discrete Complex Systems, 2016

2015

Memoryless computation: New results, constructions, and extensions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

New Constructions and Bounds for Winkler's Hat Game.

[BibT_eX]

[DOI]

Nicholas Georgiou

SIAM J. Discret. Math., 2015

Maximum Rank and Asymptotic Rank of Finite Dynamical Systems.

[BibT_eX]

[DOI]

CoRR, 2015

Universal Simulation of Automata Networks.

[BibT_eX]

[DOI]

CoRR, 2015

2014

Entropy of Closure Operators and Network Coding Solvability.

[BibT_eX]

[DOI]

Entropy, 2014

Computing in Matrix Groups Without Memory.

[BibT_eX]

[DOI]

Ben Fairbairn

Chic. J. Theor. Comput. Sci., 2014

Computing in Permutation Groups Without Memory.

[BibT_eX]

[DOI]

Ben Fairbairn

Chic. J. Theor. Comput. Sci., 2014

2013

Closure Solvability for Network Coding and Secret Sharing.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Combinatorial representations.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2013

Lexicographic identifying codes

[BibT_eX]

[DOI]

CoRR, 2013

Entropy of Closure Operators.

[BibT_eX]

[DOI]

CoRR, 2013

Generalizing bounds on the minimum distance of cyclic codes using cyclic product codes.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012

Rank Metric Decoder Architectures for Random Linear Network Coding With Error Control.

[BibT_eX]

[DOI]

IEEE Trans. Very Large Scale Integr. Syst., 2012

Remoteness of permutation codes.

[BibT_eX]

[DOI]

Eur. J. Comb., 2012

Closure solvability for network coding

[BibT_eX]

[DOI]

CoRR, 2012

2011

Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

A Matroid Framework for Noncoherent Random Network Communications.

[BibT_eX]

[DOI]

Alban Goupil

IEEE Trans. Inf. Theory, 2011

Computing without memory

[BibT_eX]

[DOI]

CoRR, 2011

A dispersion theorem for communication networks based on term sets.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Max-flow min-cut theorem for Rényi entropy in communication networks.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010

Constant-rank codes and their connection to constant-dimension codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Packing and covering properties of subspace codes for error control in random linear network coding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Max-Flow Min-Cut Theorems for Communication Networks Based on Equational Logic

[BibT_eX]

[DOI]

CoRR, 2010

2009

Bounds on covering codes with the rank metric.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2009

Rank metric decoder architectures for noncoherent error control in random network coding.

[BibT_eX]

[DOI]

Ning Chen

Proceedings of the IEEE Workshop on Signal Processing Systems, 2009

Packing and covering properties of subspace codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

Decoder error probability of bounded distance decoders for constant-dimension codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

Construction and covering properties of constant-dimension codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

2008

Packing and Covering Properties of Rank Metric Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

On the Decoder Error Probability of Bounded Rank-Distance Decoders for Maximum RankDistance Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

MacWilliams Identity for Codes with the Rank Metric.

[BibT_eX]

[DOI]

EURASIP J. Wirel. Commun. Netw., 2008

On the Decoder Error Probability of Rank Metric Codes and Constant-Dimension Codes

[BibT_eX]

[DOI]

CoRR, 2008

Packing and Covering Properties of CDCs and Subspace Codes

[BibT_eX]

[DOI]

CoRR, 2008

On the Connection between Optimal Constant-Rank Codes and Optimal Constant-Dimension Codes

[BibT_eX]

[DOI]

CoRR, 2008

Constant-rank codes.

[BibT_eX]

[DOI]

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Complexity of decoding Gabidulin codes.

[BibT_eX]

[DOI]

Proceedings of the 42nd Annual Conference on Information Sciences and Systems, 2008

2007

Properties of Rank Metric Codes

[BibT_eX]

[DOI]

CoRR, 2007

MacWilliams Identity for Codes with the Hamming and Rank Metrics

[BibT_eX]

[DOI]

CoRR, 2007

MacWilliams Identity for the Rank Metric.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

Covering Properties of Rank Metric Codes.

[BibT_eX]

[DOI]

Proceedings of the Global Communications Conference, 2007

2006

Error Performance Analysis of Maximum Rank Distance Codes

[BibT_eX]

[DOI]

CoRR, 2006

Decoder Error Probability of MRD Codes

[BibT_eX]

[DOI]

CoRR, 2006

Security of the GPT-Type Cryptosystems.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Properties of Codes with the Rank Metric.

[BibT_eX]

[DOI]