1) La descarga del recurso depende de la página de origen
2) Para poder descargar el recurso, es necesario ser usuario registrado en Universia

Opción 1: Descargar recurso

Opción 2: Descargar recurso

Detalles del recurso


The classical binary error correcting codes, and subspace codes for error correction in random network coding are two different forms of error control coding. We identify common features between these two forms and study the relations between them using the aid of lattices. Lattices are partial ordered sets where every pair of elements has a least upper bound and a greatest lower bound in the lattice. We shall demonstrate that many questions that connect these forms have a natural motivation from the viewpoint of lattices. We shall show that a lattice framework captures the notion of Singleton bound where the bound is on the size of the code as a function of its parameters. For the most part, we consider a special type of a lattice which has the geometric modular property. We will use a lattice framework to combine the two different forms. And then, in order to demonstrate the utility of this binding view, we shall derive a general version of Singleton bound. We will note that the Singleton bounds behave differently in certain respects because the binary coding framework is associated with a lattice that is distributive. We shall demonstrate that lack of distributive gives rise to a weaker bound. We show that Singleton bound for classical binary codes, subspace codes, rank metric codes and Ferrers diagram rank metric codes can be derived using a common technique. In the literature, Singleton bounds are derived for Ferrers diagram rank metric codes where the rank metric codes are linear. We introduce a generalized version of Ferrers diagram rank metric codes and obtain a Singleton bound for this version. Next, we shall prove a conjecture concerning the constraints of embedding a binary coding framework into a subspace framework. We shall prove a conjecture by Braun, Etzion and Vardy, which states that any such embedding which contains the full space in its range is constrained to have a particular size. Our proof will use a theorem due to Lovasz, a subspace counting theorem for geometric modular lattices, to prove the conjecture. We shall further demonstrate that any code that achieves the conjectured size must be of a particular type. This particular type turns out to be a natural distributive sub-lattice of a given geometric modular lattice.

Pertenece a

ETD at Indian Institute of Science  


Pai, Srikanth B - 

Id.: 70129728

Idioma: inglés (Estados Unidos)  - 

Versión: 1.0

Estado: Final

Palabras claveLattice Coding - 

Tipo de recurso: Thesis  - 

Tipo de Interactividad: Expositivo

Nivel de Interactividad: muy bajo

Audiencia: Estudiante  -  Profesor  -  Autor  - 

Estructura: Atomic

Coste: no

Copyright: sí

Requerimientos técnicos:  Browser: Any - 

Relación: [References] G27803

Fecha de contribución: 11-oct-2017



Otros recursos que te pueden interesar

  1. Unique nanostructural features in Fe, Mndoped YBCO thin films An attempt to grow a thin epitaxial composite film of YBa2Cu3O7-δ (YBCO) with spinel MnFe2O4 (MFO) n...
  2. Motivations of tourists in wine regions: the case of La Rioja Dissertação de mestrado, Economia do Turismo e Desenvolvimento Regional, Faculdade de Economia, Univ...
  3. Radio frequency system for remote fish monitoring in aquaculture Dissertação de mestrado, Engenharia Electrónica e Telecomunicações, Faculdade de Ciências e Tecnolog...
  4. Wave separation in non-uniform Hopkinson bars using redundant measurements In this paper we generalize the BCGO-wave separation method (Bussac, 2002, J. Phys. Mech. Solids, 50...
  5. The Linear and Nonlinear Response of Infinite Periodic Systems to Static and/or Dynamic Electric Fields. Implementation in CRYSTAL code. International audience

Otros recursos de la mismacolección

  1. Source And Channel Coding Techniques for The MIMO Reverse-link Channel In wireless communication systems, the use of multiple antennas, also known as Multiple-Input Multip...
  2. Data Fusion Based Physical Layer Protocols for Cognitive Radio Applications This thesis proposes and analyzes data fusion algorithms that operate on the physical layer of a wir...
  3. Bitrate Reduction Techniques for Low-Complexity Surveillance Video Coding High resolution surveillance video cameras are invaluable resources for effective crime prevention a...
  4. Neuronal Dissimilarity Indices that Predict Oddball Detection in Behaviour Our vision is as yet unsurpassed by machines because of the sophisticated representations of objects...
  5. Energy Harvesting Wireless Sensor Networks : Performance Evaluation And Trade-offs Wireless sensor networks(WSNs) have a diverse set of applications such as military surveillance, hea...

Aviso de cookies: Usamos cookies propias y de terceros para mejorar nuestros servicios, para análisis estadístico y para mostrarle publicidad. Si continua navegando consideramos que acepta su uso en los términos establecidos en la Política de cookies.