New bounds for codes over finite Frobenius rings-Reference-Cited by-同舟云学术

New bounds for codes over finite Frobenius rings

Published:2010-01-08 Issue:2 Volume:57 Page:169-179
ISSN:0925-1022
Container-title:Designs, Codes and Cryptography
language:en
Short-container-title:Des. Codes Cryptogr.

Author:

Byrne Eimear,Greferath Marcus,Kohnert Axel,Skachek Vitaly

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications

Link

http://link.springer.com/content/pdf/10.1007/s10623-009-9359-y.pdf

Reference14 articles.

1. Byrne E., Greferath M., O’Sullivan M.E.: The linear programming bound for codes over finite Frobenius rings. Des. Codes Cryptogr. 42(3), 289–301 (2007).

2. Bachoc C.: Applications of coding theory to the construction of modular lattices. J. Comb. Theory Ser. A 78-1, 92–119 (1997).

3. Constantinescu I.: Lineare Codes über Restklassenringen ganzer Zahlen und ihre Automorphismen bezüglich einer verallgemeinerten Hamming-Metrik. Ph.D. thesis, Technische Universität München (1995).

4. Constantinescu I., Heise W.: A metric for codes over residue class rings of integers. Prob. Peredachi Inform. 33(3), 22–28 (1997).

5. Greferath M., Schmidt S.E.: Finite-ring combinatorics and MacWilliams equivalence theorem. J. Comb. Theory A 92, 17–28 (2000).

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Partition-balanced families of codes and asymptotic enumeration in coding theory;Journal of Combinatorial Theory, Series A;2020-04

2. Induced weights on quotient modules and an application to error correction in coherent networks;Finite Fields and Their Applications;2018-07

3. Distances;Codes and Rings;2017

4. Lattice of ideals of the polynomial ring over a commutative chain ring;Applicable Algebra in Engineering, Communication and Computing;2015-02-19

5. Two-weight codes, graphs and orthogonal arrays;Designs, Codes and Cryptography;2015-02-14