On Linear Ordered Codes

نویسندگان

  • ALEXANDER BARG
  • WOOMYOUNG PARK
چکیده

We consider linear codes in the metric space with the Niederreiter-Rosenbloom-Tsfasman (NRT) metric, calling them linear ordered codes. In the first part of the paper we examine a linear-algebraic perspective of linear ordered codes, focusing on the distribution of “shapes” of codevectors. We define a multivariate Tutte polynomial of the linear code and prove a duality relation for the Tutte polynomial of the code and its dual code. We further relate the Tutte polynomial to the distribution of support shapes of linear ordered codes, and find this distribution for ordered MDS codes. Using these results as a motivation, we consider ordered matroids defined for the NRT poset and establish basic properties of their Tutte polynomials. We also discuss connections of linear ordered codes with simple models of information transmission channels.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Soft decision decoding of linear block codes based on ordered statistics in multilevel signaling

| Soft decision decoding of linear block codes based on ordered statistics is discussed in the context of multilevel coding with multistage decoding. Analytical expressions on the ordered statistics and the associated bit error probability have been derived. The result shows tradeo s between error performance and decoding complexity in multilevel signaling including BPSK modulation formats as a...

متن کامل

Title of dissertation : APPLICATIONS OF ORDERED WEIGHTS IN INFORMATION TRANSMISSION

Title of dissertation: APPLICATIONS OF ORDERED WEIGHTS IN INFORMATION TRANSMISSION Woomyoung Park Doctor of Philosophy, 2012 Dissertation directed by: Professor Alexander Barg Department of Electrical and Computer Engineering and Institute for Systems Research This dissertation is devoted to a study of a class of linear codes related to a particular metric space that generalizes the Hamming spa...

متن کامل

Association Schemes for Ordered Orthogonal Arrays and (t,m,s)-nets

In an earlier paper 9], we studied a generalized Rao bound for ordered orthogonal arrays and (T; M; S)-nets. In this paper, we extend this to a coding-theoretic approach to ordered orthogonal arrays. Using a certain association scheme, we prove a MacWilliams-type theorem for linear ordered orthogonal arrays and linear ordered codes as well as a linear programming bound for the general case. We ...

متن کامل

Constacyclic Codes over Group Ring (Zq[v])/G

Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...

متن کامل

Semidefinite programming for permutation codes

We initiate study of the Terwilliger algebra and related semidefinite programming techniques for the conjugacy scheme of the symmetric group Sym(n). In particular, we compute orbits of ordered pairs on Sym(n) acted upon by conjugation and inversion, explore a block di-agonalization of the associated algebra, and obtain improved upper bounds on the size M (n, d) of permutation codes of lengths u...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015