The predictable degree property and minimality in multidimensional convolutional coding

作     者：Lomadze, Vakhtang 

作者机构：I Javakhishvili State Univ Math Dept A Razmadze Math Inst Tbilisi Georgia 

出 版 物：《DISCRETE MATHEMATICS》 (离散数学)

年 卷 期：2019年第342卷第3期

页      面：784-792页

核心收录：

学科分类：07[理学] 0701[理学-数学] 070101[理学-基础数学] 

主　　题：Convolutional code Filtered module PD property Proper representation Minimality Graded module 

摘      要：Convolutional codes inherit from polynomials a natural structure of a filtered module, which is a fundamental structure and therefore should be taken into account. Pursuing this idea, we define higher-dimensional analogs of the predictable degree property, Forney s indices and overall constraint length;also, we address the important issue of minimality. (C) 2018 Elsevier B.V. All rights reserved.