课题基金 / 基金详情

Decoding Interleaved Gabidulin Codes by Module Minimization

Decoding Interleaved Gabidulin Codes by Module Minimization
通过模块最小化解码交错加比杜林代码
批准号:
261867389
负责人:
Professor Dr.-Ing. Martin Bossert
金额:
$0.0万
依托单位国家:
德国
项目类别:
Research Grants
财政年份:
2014
资助国家:
德国
项目状态:
已结题
起止时间:
2013-12-31 至 2022-12-31

项目摘要

项目成果

Professor Dr.-Ing. Martin Bossert的其他基金

相似基金

相关文献

中文摘要
翻译
最近研究表明,利用模最小化方法可以有效地译码Reed-Solomon码。在这个项目中,我们建议使用模块最小化解码交织Gabidulin码。 要做到这一点,我们应该找到算法,解决模块的最小化问题的非交换环上的斜多项式。这种推广是一个不平凡的任务,因为环的非交换性。 我们的目标是得到低复杂度的算法解码交织Gabidulin码的秩度量远远超过一半的最小距离。 这些算法可以立即应用于随机网络编码、分布式存储和密码学。
英文摘要
Recently it was shown that Reed-Solomon codes can be efficiently decoded using the method of module minimization. In this project we suggest to use module minimization for decoding interleaved Gabidulin codes. To do this we should find algorithms which solve the module minimization problem for modules over non commutative rings of skew polynomials. This generalization is a non trivial task because of the non commutativity of the ring. Our goals are to get low complexity algorithms for decoding interleaved Gabidulin codes in rank metric far beyond half the minimum distance. These algorithms can be immediately applied for random network coding, distributive storage, and cryptography.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
Complex-valued Reed-Solomon Codes for Deterministic Compressed Sensing
  • 批准号:
    273209895
  • 项目类别:
    Priority Programmes
  • 资助金额:
    $0.0万
  • 财政年份:
    2015
  • 负责人:
    Professor Dr.-Ing. Martin Bossert
  • 依托单位:
Rank-Metric in Coding Theory and Machine Learning
  • 批准号:
    257536834
  • 项目类别:
    Research Grants
  • 资助金额:
    $0.0万
  • 财政年份:
    2015
  • 负责人:
    Professor Dr.-Ing. Martin Bossert
  • 依托单位:
coordinations project
  • 批准号:
    252239977
  • 项目类别:
    Priority Programmes
  • 资助金额:
    $0.0万
  • 财政年份:
    2014
  • 负责人:
    Professor Dr.-Ing. Martin Bossert
  • 依托单位:
Improving the Reliability of RNA-seq: Approaching Single-Cell Transcriptomics to Explore Individuality in Bacteria
海外基金