2011, 5(2): 225-232. doi: 10.3934/amc.2011.5.225

On lattices, binary codes, and network codes

1. 

University of Applied Sciences Darmstadt, Faculty of Computer Science, D-64295 Darmstadt, Germany

Received  April 2010 Revised  October 2010 Published  May 2011

Network codes are sets of subspaces of a finite vectorspace over a finite field. Recently, this class of codes has found application in the error correction of message transmission within networks. Furthermore, binary codes can be represented as sets of subsets of a finite set. Hence, both kinds of codes can be regarded as substructures of lattices — in the first case it is the linear lattice and in the second case it is the power set lattice. This observation leads us to a more general investigation of similarities of both theories by means of lattice theory. In this paper we first examine general results of lattices in order to comprise basic considerations of network coding and binary vector coding theory. Afterwards we consider the issue of finding complements of subspaces.
Citation: 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
References:
[1]

G. Birkhoff, "Lattice Theory,'' revised edition,, Amer. Math. Soc. Colloquium Publications, (1948).

[2]

W. E. Clark, Matching subspaces with complements in finite vector spaces,, in, 8 (1992), 33.

[3]

T. Etzion and A. Vardy, Coding theory in projective spaces,, in, (2008).

[4]

T. Etzion and A. Vardy, Error-correcting codes in projective spaces,, in, (2008). doi: 10.1109/ISIT.2008.4595111.

[5]

R. Koetter and F. Kschischang, Coding for errors and erasures in random network coding,, IEEE Trans. Inform. Theory, 54 (2008), 3579. doi: 10.1109/TIT.2008.926449.

show all references

References:
[1]

G. Birkhoff, "Lattice Theory,'' revised edition,, Amer. Math. Soc. Colloquium Publications, (1948).

[2]

W. E. Clark, Matching subspaces with complements in finite vector spaces,, in, 8 (1992), 33.

[3]

T. Etzion and A. Vardy, Coding theory in projective spaces,, in, (2008).

[4]

T. Etzion and A. Vardy, Error-correcting codes in projective spaces,, in, (2008). doi: 10.1109/ISIT.2008.4595111.

[5]

R. Koetter and F. Kschischang, Coding for errors and erasures in random network coding,, IEEE Trans. Inform. Theory, 54 (2008), 3579. doi: 10.1109/TIT.2008.926449.

[1]

Cem Güneri, Ferruh Özbudak, Funda ÖzdemIr. On complementary dual additive cyclic codes. Advances in Mathematics of Communications, 2017, 11 (2) : 353-357. doi: 10.3934/amc.2017028

[2]

Vincenzo Recupero. Hysteresis operators in metric spaces. Discrete & Continuous Dynamical Systems - S, 2015, 8 (4) : 773-792. doi: 10.3934/dcdss.2015.8.773

[3]

Alexander A. Davydov, Massimo Giulietti, Stefano Marcugini, Fernanda Pambianco. Linear nonbinary covering codes and saturating sets in projective spaces. Advances in Mathematics of Communications, 2011, 5 (1) : 119-147. doi: 10.3934/amc.2011.5.119

[4]

Daniele Bartoli, Matteo Bonini, Massimo Giulietti. Constant dimension codes from Riemann-Roch spaces. Advances in Mathematics of Communications, 2017, 11 (4) : 705-713. doi: 10.3934/amc.2017051

[5]

Joaquim Borges, Ivan Yu. Mogilnykh, Josep Rifà, Faina I. Solov'eva. Structural properties of binary propelinear codes. Advances in Mathematics of Communications, 2012, 6 (3) : 329-346. doi: 10.3934/amc.2012.6.329

[6]

Rinaldo M. Colombo, Graziano Guerra. Differential equations in metric spaces with applications. Discrete & Continuous Dynamical Systems - A, 2009, 23 (3) : 733-753. doi: 10.3934/dcds.2009.23.733

[7]

Jaeyoo Choy, Hahng-Yun Chu. On the dynamics of flows on compact metric spaces. Communications on Pure & Applied Analysis, 2010, 9 (1) : 103-108. doi: 10.3934/cpaa.2010.9.103

[8]

Steven T. Dougherty, Esengül Saltürk, Steve Szabo. Codes over local rings of order 16 and binary codes. Advances in Mathematics of Communications, 2016, 10 (2) : 379-391. doi: 10.3934/amc.2016012

[9]

Claude Carlet, Sylvain Guilley. Complementary dual codes for counter-measures to side-channel attacks. Advances in Mathematics of Communications, 2016, 10 (1) : 131-150. doi: 10.3934/amc.2016.10.131

[10]

Finley Freibert. The classification of complementary information set codes of lengths $14$ and $16$. Advances in Mathematics of Communications, 2013, 7 (3) : 267-278. doi: 10.3934/amc.2013.7.267

[11]

Stefka Bouyuklieva, Anton Malevich, Wolfgang Willems. On the performance of binary extremal self-dual codes. Advances in Mathematics of Communications, 2011, 5 (2) : 267-274. doi: 10.3934/amc.2011.5.267

[12]

Rafael Arce-Nazario, Francis N. Castro, Jose Ortiz-Ubarri. On the covering radius of some binary cyclic codes. Advances in Mathematics of Communications, 2017, 11 (2) : 329-338. doi: 10.3934/amc.2017025

[13]

Ugo Bessi. The stochastic value function in metric measure spaces. Discrete & Continuous Dynamical Systems - A, 2017, 37 (4) : 1819-1839. doi: 10.3934/dcds.2017076

[14]

Thomas Lorenz. Mutational inclusions: Differential inclusions in metric spaces. Discrete & Continuous Dynamical Systems - B, 2010, 14 (2) : 629-654. doi: 10.3934/dcdsb.2010.14.629

[15]

Martin Bauer, Martins Bruveris, Philipp Harms, Peter W. Michor. Soliton solutions for the elastic metric on spaces of curves. Discrete & Continuous Dynamical Systems - A, 2018, 38 (3) : 1161-1185. doi: 10.3934/dcds.2018049

[16]

Saul Mendoza-Palacios, Onésimo Hernández-Lerma. Stability of the replicator dynamics for games in metric spaces. Journal of Dynamics & Games, 2017, 4 (4) : 319-333. doi: 10.3934/jdg.2017017

[17]

Amin Sakzad, Mohammad-Reza Sadeghi. On cycle-free lattices with high rate label codes. Advances in Mathematics of Communications, 2010, 4 (4) : 441-452. doi: 10.3934/amc.2010.4.441

[18]

Jérôme Ducoat, Frédérique Oggier. On skew polynomial codes and lattices from quotients of cyclic division algebras. Advances in Mathematics of Communications, 2016, 10 (1) : 79-94. doi: 10.3934/amc.2016.10.79

[19]

Tsonka Baicheva, Iliya Bouyukliev. On the least covering radius of binary linear codes of dimension 6. Advances in Mathematics of Communications, 2010, 4 (3) : 399-404. doi: 10.3934/amc.2010.4.399

[20]

Christine Bachoc, Gilles Zémor. Bounds for binary codes relative to pseudo-distances of $k$ points. Advances in Mathematics of Communications, 2010, 4 (4) : 547-565. doi: 10.3934/amc.2010.4.547

2017 Impact Factor: 0.564

Metrics

  • PDF downloads (1)
  • HTML views (0)
  • Cited by (2)

Other articles
by authors

[Back to Top]