Coding in the presence of semantic value of decodification errors and codification...
Metrics in the context of information theory and error correcting codes
Computer vision applied to the monitoring of individual body mass of finishing pigs
Grant number: | 15/11286-8 |
Support Opportunities: | Scholarships in Brazil - Doctorate |
Start date: | September 01, 2015 |
End date: | September 07, 2019 |
Field of knowledge: | Physical Sciences and Mathematics - Mathematics |
Agreement: | Coordination of Improvement of Higher Education Personnel (CAPES) |
Principal Investigator: | Marcelo Firer |
Grantee: | Roberto Assis Machado |
Host Institution: | Instituto de Matemática, Estatística e Computação Científica (IMECC). Universidade Estadual de Campinas (UNICAMP). Campinas , SP, Brazil |
Associated research grant: | 13/25977-7 - Security and reliability of Information: theory and practice, AP.TEM |
Associated scholarship(s): | 17/14616-4 - Generalizations of threshold graphs, BE.EP.DR |
Abstract A message transmitted through a communication channel is subjected to transmission errors, that is, the receiver cannot identify the original message that was sent him. There is a decoding method called nearest neighbour that uses a metric to determine the closest codeword to the received message. In the classical coding theory, we often consider the Hamming or Lee metrics. Considering these metrics, some metric aspects of codes were studied, such as: (I) packing radius, (II) covering radius, (III) MacWilliams identity, (IV) perfect codes, etc. The use of the Hamming or Lee metrics is justified by the fact that the nearest neighbour decoding matches to the maximum likelihood decoding for the simplest channel model, the memoryless symmetric channel. For complex channels it is necessary to define and study other families of metrics and the metric aspects of the codes admitting these metrics. In 1995, Brualdi, Graves and Lawrence introduced a generalization for Hamming metric called poset metrics. Several relations obtained for the Hamming metric were extended to the family of hierarchical poset metrics over the years. These results appear dispersed through the literature with long proofs. Considering the systematic-canonical form for linear codes, introduced in 2012 by Felix and Firer, we prove these and other properties, that characterize the hierarchical poset metrics in a simple and short way. The first generalization of poset metrics, called poset-blocks metric, (that allows a large "flexibility" to construct metrics balls) was introduced by Alves, Panek and Firer, in 2008. To this family, the detailed description of the symmetry group and the characterization of a MacWilliams-type identity are already known. In this year, some generalizations of the poset metrics were proposed (still unpublished works): (a) directed graph metric; (b) coverage metric; (c) poset-Lee metric; (d) semi-lattice metric.In this project we propose to study metric aspects of linear codes for those generalizations. (AU) | |
News published in Agência FAPESP Newsletter about the scholarship: | |
More itemsLess items | |
TITULO | |
Articles published in other media outlets ( ): | |
More itemsLess items | |
VEICULO: TITULO (DATA) | |
VEICULO: TITULO (DATA) | |