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

Descripción

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  

Autor(es)

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: 10-ene-2018

Contacto:

Localización:

Otros recursos que te pueden interesar

  1. In Search of Other Borders: Guatemalan-Mexican Communities in Southern Mexico Abstract Accounting 35 years after arriving to Mexico, Guatemalan families with Mayan ethnic origins...
  2. Music education in primary compulsory schools in Croatia and Serbia from 1945 to 1990, in the context of school curricula After the Second World War, one of the priorities of cultural policy in the domain of music was the ...
  3. Decision-making at different levels of ration-ality: Subjects’s cognitive, neural and psycho-dynamic characteristics In modern science, the issue of studying the decision-making process is challenging. If these decisi...
  4. An empirical examination of the relationships among creativity, the evaluation of creative products, and cognitive style among chinese undergraduates The current study investigates creativity from a creative product perspective. More specifically, we...
  5. Cognitive dialog games as cognitive assistants: Tracking and adapting knowledge and interactions in student’s dialogs This study introduces a system design in a form of cognitive dialog game (DiaCog) to support pedagog...

Otros recursos de la mismacolección

  1. Robust Nonparametric Sequential Distributed Spectrum Sensing under EMI and Fading Opportunistic use of unused spectrum could efficiently be carried out using the paradigm of Cognitiv...
  2. Optical WDM Systems for Multi-point Distribution of Hybrid Signals in Phased Array Radar Applications Photonics and Optical techniques have advanced recently by a great extend to play an important role ...
  3. On Codes for Private Information Retrieval and Ceph Implementation of a High-Rate Regenerating Code Error-control codes, which are being extensively used in communication systems, have found themselve...
  4. Secret Key Generation in the Multiterminal Source Model : Communication and Other Aspects This dissertation is primarily concerned with the communication required to achieve secret key (SK) ...
  5. Optimal Mechanisms for Selling Two Heterogeneous Items We consider the problem of designing revenue-optimal mechanisms for selling two heterogeneous items ...

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.