On applications of orbit codes to storage

Previous Article
The one-out-of-k retrieval problem and linear network coding
AMC Home
This Issue
Next Article
Complementary dual codes for counter-measures to side-channel attacks

February 2016, 10(1): 113-130. doi: 10.3934/amc.2016.10.113

On applications of orbit codes to storage

Shiqiu Liu ^1, and Frédérique Oggier ^1,

1.	Division of Mathematical Sciences, School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore

Received December 2014 Revised July 2015 Published March 2016

Abstract
Related Papers

We consider orbit codes, namely subspace codes obtained from orbits of the action of subgroups of $GL_n(\mathbb{F}_q)$ on $m$-dimensional subspaces of $\mathbb{F}_q^n$. We discuss their applicability to design storage codes, in particular in the context of collaborative repair: we identify known storage codes that can be interpreted as orbit codes, motivate why orbit codes provide good candidates for storage codes, and translate the storage code parameters into those of the algebraic objects involved. Two simple families of storage orbit codes are given.

Keywords: orbit codes, storage codes., partial repair, Group action, subspace codes.

Mathematics Subject Classification: Primary 20H20; Secondary 11T7.

Citation: Shiqiu Liu, Frédérique Oggier. On applications of orbit codes to storage. Advances in Mathematics of Communications, 2016, 10 (1) : 113-130. doi: 10.3934/amc.2016.10.113

References:

[1]	H. D. L. Hollmann, Storage codes - coding rate and repair locality,, in Int. Conf. Comp. Netw. Commun., (2013), 830.
[2]	A.-M. Kermarrec, N. Le Scouarnec and G. Straub, Repairing multiple failures with coordinated and adaptive regenerating codes,, in Int. Symp. Network Coding, (2011), 1.
[3]	S. Kim, Linear algebra from module theory perspective,, available online at , ().
[4]	R. Lidl and H. Niederreiter, Introduction to Finite Fields and their Applications,, Cambridge Univ. Press, (1986).
[5]	S. Liu and F. Oggier, On storage codes allowing partially collaborative repairs,, in IEEE Int. Symp. Inf. Theory, (2014), 2440.
[6]	S. Liu and F. Oggier, Two storage code constructions allowing partially collaborative repairs,, in Int. Symp. Inf. Theory Appl., (2014), 378.
[7]	S. Liu and F. Oggier, On the Design of Storage Orbit Codes,, in Coding Theory and Applications, (2015), 263.
[8]	F. Oggier, Some constructions of storage codes from Grassmann graphs,, in Proc. Int. Zurich Sem. Commun., (2014).
[9]	F. Oggier and A. Datta, Self-repairing codes for distributed storage - a projective geometric construction,, in IEEE Inf. Theory Workshop, (2011), 30.
[10]	F. Oggier and A. Datta, Coding Techniques for Repairability in Networked Distributed Storage Systems,, Now Publishers, (2013).
[11]	K. V. Rashmi, N. B. Shah, P. V. Kumar and K. Ramchandran, Explicit construction of optimal exact regenerating codes for distributed storage,, in 47th Ann. Allerton Conf. Commun. Control Comput., (2009), 1243.
[12]	N. Raviv and T. Etzion, Distributed storage systems based on equidistant subspace codes,, preprint, ().
[13]	K. W. Shum and Y. Hu, Cooperative regenerating codes,, IEEE Trans. Inf. Theory, (2013), 7229. doi: 10.1109/TIT.2013.2274265.
[14]	A.-L. Trautmann, F. Manganiello, M. Braun and J. Rosenthal, Cyclic orbit codes,, IEEE Trans. Inf. Theory, 59 (2013), 7386. doi: 10.1109/TIT.2013.2274266.
[15]	Z. Wang, I. Tamo and J. Bruck, Long MDS codes for optimal repair bandwidth,, in IEEE Int. Symp. Inf. Theory, (2012), 1182.

show all references

References:

[1]	H. D. L. Hollmann, Storage codes - coding rate and repair locality,, in Int. Conf. Comp. Netw. Commun., (2013), 830.
[2]	A.-M. Kermarrec, N. Le Scouarnec and G. Straub, Repairing multiple failures with coordinated and adaptive regenerating codes,, in Int. Symp. Network Coding, (2011), 1.
[3]	S. Kim, Linear algebra from module theory perspective,, available online at , ().
[4]	R. Lidl and H. Niederreiter, Introduction to Finite Fields and their Applications,, Cambridge Univ. Press, (1986).
[5]	S. Liu and F. Oggier, On storage codes allowing partially collaborative repairs,, in IEEE Int. Symp. Inf. Theory, (2014), 2440.
[6]	S. Liu and F. Oggier, Two storage code constructions allowing partially collaborative repairs,, in Int. Symp. Inf. Theory Appl., (2014), 378.
[7]	S. Liu and F. Oggier, On the Design of Storage Orbit Codes,, in Coding Theory and Applications, (2015), 263.
[8]	F. Oggier, Some constructions of storage codes from Grassmann graphs,, in Proc. Int. Zurich Sem. Commun., (2014).
[9]	F. Oggier and A. Datta, Self-repairing codes for distributed storage - a projective geometric construction,, in IEEE Inf. Theory Workshop, (2011), 30.
[10]	F. Oggier and A. Datta, Coding Techniques for Repairability in Networked Distributed Storage Systems,, Now Publishers, (2013).
[11]	K. V. Rashmi, N. B. Shah, P. V. Kumar and K. Ramchandran, Explicit construction of optimal exact regenerating codes for distributed storage,, in 47th Ann. Allerton Conf. Commun. Control Comput., (2009), 1243.
[12]	N. Raviv and T. Etzion, Distributed storage systems based on equidistant subspace codes,, preprint, ().
[13]	K. W. Shum and Y. Hu, Cooperative regenerating codes,, IEEE Trans. Inf. Theory, (2013), 7229. doi: 10.1109/TIT.2013.2274265.
[14]	A.-L. Trautmann, F. Manganiello, M. Braun and J. Rosenthal, Cyclic orbit codes,, IEEE Trans. Inf. Theory, 59 (2013), 7386. doi: 10.1109/TIT.2013.2274266.
[15]	Z. Wang, I. Tamo and J. Bruck, Long MDS codes for optimal repair bandwidth,, in IEEE Int. Symp. Inf. Theory, (2012), 1182.

[1]	Olof Heden, Martin Hessler. On linear equivalence and Phelps codes. Addendum. Advances in Mathematics of Communications, 2011, 5 (3) : 543-546. doi: 10.3934/amc.2011.5.543
[2]	Heide Gluesing-Luerssen, Carolyn Troha. Construction of subspace codes through linkage. Advances in Mathematics of Communications, 2016, 10 (3) : 525-540. doi: 10.3934/amc.2016023
[3]	Ernst M. Gabidulin, Pierre Loidreau. Properties of subspace subcodes of Gabidulin codes. Advances in Mathematics of Communications, 2008, 2 (2) : 147-157. doi: 10.3934/amc.2008.2.147
[4]	Sergio Estrada, J. R. García-Rozas, Justo Peralta, E. Sánchez-García. Group convolutional codes. Advances in Mathematics of Communications, 2008, 2 (1) : 83-94. doi: 10.3934/amc.2008.2.83
[5]	Heide Gluesing-Luerssen, Katherine Morrison, Carolyn Troha. Cyclic orbit codes and stabilizer subfields. Advances in Mathematics of Communications, 2015, 9 (2) : 177-197. doi: 10.3934/amc.2015.9.177
[6]	Thomas Honold, Michael Kiermaier, Sascha Kurz. Constructions and bounds for mixed-dimension subspace codes. Advances in Mathematics of Communications, 2016, 10 (3) : 649-682. doi: 10.3934/amc.2016033
[7]	Daniel Heinlein, Sascha Kurz. Binary subspace codes in small ambient spaces. Advances in Mathematics of Communications, 2018, 12 (4) : 817-839. doi: 10.3934/amc.2018048
[8]	Washiela Fish, Jennifer D. Key, Eric Mwambene. Partial permutation decoding for simplex codes. Advances in Mathematics of Communications, 2012, 6 (4) : 505-516. doi: 10.3934/amc.2012.6.505
[9]	Terasan Niyomsataya, Ali Miri, Monica Nevins. Decoding affine reflection group codes with trellises. Advances in Mathematics of Communications, 2012, 6 (4) : 385-400. doi: 10.3934/amc.2012.6.385
[10]	Jamshid Moori, Amin Saeidi. Some designs and codes invariant under the Tits group. Advances in Mathematics of Communications, 2017, 11 (1) : 77-82. doi: 10.3934/amc.2017003
[11]	Cristina García Pillado, Santos González, Victor Markov, Consuelo Martínez, Alexandr Nechaev. New examples of non-abelian group codes. Advances in Mathematics of Communications, 2016, 10 (1) : 1-10. doi: 10.3934/amc.2016.10.1
[12]	Olof Heden. The partial order of perfect codes associated to a perfect code. Advances in Mathematics of Communications, 2007, 1 (4) : 399-412. doi: 10.3934/amc.2007.1.399
[13]	Dean Crnković, Bernardo Gabriel Rodrigues, Sanja Rukavina, Loredana Simčić. Self-orthogonal codes from orbit matrices of 2-designs. Advances in Mathematics of Communications, 2013, 7 (2) : 161-174. doi: 10.3934/amc.2013.7.161
[14]	Ettore Fornasini, Telma Pinho, Raquel Pinto, Paula Rocha. Composition codes. Advances in Mathematics of Communications, 2016, 10 (1) : 163-177. doi: 10.3934/amc.2016.10.163
[15]	Michael Braun. On lattices, binary codes, and network codes. Advances in Mathematics of Communications, 2011, 5 (2) : 225-232. doi: 10.3934/amc.2011.5.225
[16]	Alexis Eduardo Almendras Valdebenito, Andrea Luigi Tironi. On the dual codes of skew constacyclic codes. Advances in Mathematics of Communications, 2018, 12 (4) : 659-679. doi: 10.3934/amc.2018039
[17]	Gokhan Calis, O. Ozan Koyluoglu. Architecture-aware coding for distributed storage: Repairable block failure resilient codes. Advances in Mathematics of Communications, 2018, 12 (3) : 465-503. doi: 10.3934/amc.2018028
[18]	Olof Heden, Fabio Pasticci, Thomas Westerbäck. On the existence of extended perfect binary codes with trivial symmetry group. Advances in Mathematics of Communications, 2009, 3 (3) : 295-309. doi: 10.3934/amc.2009.3.295
[19]	Crnković Dean, Vedrana Mikulić Crnković, Bernardo G. Rodrigues. On self-orthogonal designs and codes related to Held's simple group. Advances in Mathematics of Communications, 2018, 12 (3) : 607-628. doi: 10.3934/amc.2018036
[20]	Axel Kohnert, Johannes Zwanzger. New linear codes with prescribed group of automorphisms found by heuristic search. Advances in Mathematics of Communications, 2009, 3 (2) : 157-166. doi: 10.3934/amc.2009.3.157

2018 Impact Factor: 0.879

American Institute of Mathematical Sciences