Dr Maximilien Gadouleau's Outputs (3)

Closure Solvability for Network Coding and Secret Sharing (2013)
Journal Article
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

Network coding is a new technique to transmit data through a network by letting the intermediate nodes combine the packets they receive. Given a network, the network coding solvability problem decides whether all the packets requested by the destinat... Read More about Closure Solvability for Network Coding and Secret Sharing.

Combinatorial Representations (2013)
Journal Article
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

This paper introduces combinatorial representations, which generalise the notion of linear representations of matroids. We show that any family of subsets of the same cardinality has a combinatorial representation via matrices. We then prove that any... Read More about Combinatorial Representations.

Generalizing Bounds on the Minimum Distance of Cyclic Codes Using Cyclic Product Codes (2013)
Presentation / Conference Contribution
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

Two generalizations of the Hartmann-Tzeng (HT) bound on the minimum distance of q-ary cyclic codes are proposed. The first one is proven by embedding the given cyclic code into a cyclic product code. Furthermore, we show that unique decoding up to th... Read More about Generalizing Bounds on the Minimum Distance of Cyclic Codes Using Cyclic Product Codes.