Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Bücher
Zeitschriften
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
MTZ-Fachkongress

Antriebe und Energiesysteme von morgen


Austausch von Automobil- und Energiewirtschaft

Am 14./15. Mai geht es in Chemnitz um die Mobilitätswende durch Elektro- und Wasserstofffahrzeuge.
Erweiterte Suche
Anmelden
nach oben
Designs, Codes and Cryptography
Erschienen in: Designs, Codes and Cryptography 1/2015

01.04.2015

Demi-matroids from codes over finite Frobenius rings

verfasst von: Thomas Britz, Keisuke Shiromoto, Thomas Westerbäck

Erschienen in: Designs, Codes and Cryptography | Ausgabe 1/2015

Einloggen, um Zugang zu erhalten

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

We present a construction of demi-matroids, a generalization of matroids, from linear codes over finite Frobenius rings, as well as a Greene-type identity for rank generating functions of demi-matroids. We also prove a MacWilliams-type identity for Hamming support enumerators of linear codes over finite Frobenius rings. As a special case, these results give a combinatorial proof of the MacWilliams identity for Hamming weight enumerators of linear codes over finite Frobenius rings.
Vorheriger Artikel Perfect codes in the discrete simplex
Nächster Artikel Optimal three-dimensional optical orthogonal codes of weight three
Literatur
1.
Barg A.: The matroid of supports of a linear code. Appl. Algebra Eng. Comm. Comput. 8, 165–172 (1997).
2.
Britz T.: MacWilliams identities and matroid polynomials (Research Paper). Electron. J. Comb. 9(1), 16 pp. (2002).
3.
Britz T.: Extensions of the critical theorem. Discret. Math. 305, 55–73 (2005).
4.
Britz T.: Higher support matroids. Discret. Math. 307, 2300–2308 (2007).
5.
Britz T., Shiromoto K.: A MacWilliams type identity for matroids. Discret. Math. 308, 4551–4559 (2008).
6.
Britz T.: Code enumerators and Tutte polynomials. IEEE Trans. Inf. Theory 56, 4350–4358 (2010).
7.
Britz T., Johnsen T., Mayhew D., Shiromoto K.: Wei-type duality theorems for matroids. Des. Codes Cryptogr. 62, 331–341 (2012).
8.
Crapo H., Rota G.-C.: On the Foundations of Combinatorial Theory: Combinatorial Geometries, Preliminary edn. MIT Press, Cambridge (1970).
9.
Greene C.: Weight enumeration and the geometry of linear codes. Stud. Appl. Math. 55, 119–128 (1976).
10.
Hammons A.R. Jr., Kumar P.V., Calderbank A.R., Sloane N.J.A., Solé P.: The \(Z_{4}\)-linearity of Kerdock, Preparata, Goethals and related codes. IEEE Trans. Inf. Theory 40(2), 301–319 (1994).
11.
Honold T.: Characterization of finite Frobenious rings. Arch. Math. 76, 406–415 (2001).
12.
Honold T., Landjev I.: MacWilliams identities for linear codes over finite Frobenius rings. In: Jungnickel, D., Niederreiter, H. (eds.) Finite Fields and Applications, pp. 276–291. Springer, Berlin (2001).
13.
Huffman W., Pless V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003).
14.
Lam T.Y.: Lectures on Modules and Rings. Springer-Verlag, New York (1999).
15.
MacWilliams F.J.: A theorem on the distribution of weights in a systematic code. Bell Syst. Tech. J. 42, 79–94 (1963).
16.
Shiromoto K.: A new MacWilliams type identity for linear codes. Hokkaido Math. J. 25, 651–656 (1996).
17.
Van Lint J.H., Wilson R.M.: A Course in Combinatorics, 2nd edn. Cambridge University Press, Cambridge (2001).
18.
Wei V.K.: Generalized hamming weights for linear codes. IEEE Trans. Inf. Theory 37, 1412–1418 (1991).
19.
Welsh D.J.A.: Matroid Theory. Academic Press, London (1976).
20.
Wood J.A.: Duality for modules over finite rings and applications to coding theory. Am. J. Math. 121, 555–575 (1999).
21.
Wood J.A.: Foundations of linear codes defined over finite modules: the extension theorem and the MacWilliams identities. In: Solé P. (ed.) Codes over Rings, pp. 124–190. World Scientific, Singapore (2009).
Metadaten
Titel
Demi-matroids from codes over finite Frobenius rings
verfasst von
Thomas Britz
Keisuke Shiromoto
Thomas Westerbäck
Publikationsdatum
01.04.2015
Verlag
Springer US
Erschienen in
Designs, Codes and Cryptography / Ausgabe 1/2015
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI
https://doi.org/10.1007/s10623-013-9895-3

Weitere Artikel der Ausgabe 1/2015

Designs, Codes and Cryptography 1/2015 Zur Ausgabe

OriginalPaper

New lower bounds on the aperiodic Hamming correlations of frequency hopping sequences with low hit zone

OriginalPaper

On point-transitive and transitive deficiency one parallelisms of PG

OriginalPaper

Xing–Ling codes, duals of their subcodes, and good asymmetric quantum codes

OriginalPaper

Speeding up deciphering by hypergraph ordering

OriginalPaper

Hardness of learning problems over Burnside groups of exponent 3

OriginalPaper

On relative constant-weight codes

Premium Partner

    Bildnachweise