Thomas Honold

According to our database1, Thomas Honold authored at least 34 papers between 1994 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Transformation invariance in the Combinatorial Nullstellensatz and nowhere-zero points of non-singular matrices.
Discret. Math., November, 2023

On homogeneous arcs and linear codes over finite chain rings.
Appl. Algebra Eng. Commun. Comput., May, 2023

2021
The Geometry of Two-Weight Codes Over ℤ<sub>p</sub><sup>m</sup>.
IEEE Trans. Inf. Theory, 2021

2020
The Lengths of Projective Triply-Even Binary Codes.
IEEE Trans. Inf. Theory, 2020

New upper bounds on the maximal size of an arc in a projective Hjelmslev plane.
Proceedings of the Algebraic and Combinatorial Coding Theory, 2020

2019
Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6.
Des. Codes Cryptogr., 2019

Johnson Type Bounds for Mixed Dimension Subspace Codes.
Electron. J. Comb., 2019

Generalized vector space partitions.
Australas. J Comb., 2019

2017
The Extension Theorem for Bi-invariant Weights over Frobenius Rings and Frobenius Bimodules.
CoRR, 2017

2016
The Expurgation-Augmentation Method for Constructing Good Plane Subspace Codes.
CoRR, 2016

Constructions and bounds for mixed-dimension subspace codes.
Adv. Math. Commun., 2016

Beyond countable alphabets: An extension of the information-spectrum approach.
Proceedings of the 8th International Conference on Wireless Communications & Signal Processing, 2016

2014
Constructing Linear Encoders With Good Spectra.
IEEE Trans. Inf. Theory, 2014

MacWilliams' Extension Theorem for bi-invariant weights over finite principal ideal rings.
J. Comb. Theory, Ser. A, 2014

Poster: A new approach to the Main Problem of Subspace Coding.
Proceedings of the 9th International Conference on Communications and Networking in China, 2014

2013
Non-free extensions of the simplex codes over a chain ring with four elements.
Des. Codes Cryptogr., 2013

The existence of maximal (q 2, 2)-arcs in projective Hjelmslev planes over chain rings of length 2 and odd prime characteristic.
Des. Codes Cryptogr., 2013

2012
Good random matrices over finite fields.
Adv. Math. Commun., 2012

2011
Weight Distributions of Regular Low-Density Parity-Check Codes Over Finite Fields.
IEEE Trans. Inf. Theory, 2011

The dual construction for arcs in projective Hjelmslev spaces.
Adv. Math. Commun., 2011

Towards the capacity region of multiplicative linear operator broadcast channels.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011

An upper bound on broadcast subspace codes.
Proceedings of the 6th International ICST Conference on Communications and Networking in China, 2011

2009
Constructing Linear Codes with Good Spectra
CoRR, 2009

Cross-layer iterative decoding of irregular LDPC codes using cyclic redundancy check codes.
Proceedings of the 2009 IEEE Wireless Communications and Networking Conference, 2009

2008
Ring geometries, two-weight codes, and strongly regular graphs.
Des. Codes Cryptogr., 2008

Constructing Linear Codes with Good Joint Spectra
CoRR, 2008

Nachweis der Güte von Kombinationen des CRC.
Proceedings of the Sicherheit 2008: Sicherheit, 2008

Analysis of Nested CRC with Additional Net Data in Communication.
Proceedings of the Computer Safety, 2008

2007
Analysis of Combinations of CRC in Industrial Communication.
Proceedings of the Computer Safety, 2007

2005
On maximal arcs in projective Hjelmslev planes over chain rings of even characteristic.
Finite Fields Their Appl., 2005

2001
On arcs in projective Hjelmslev planes.
Discret. Math., 2001

2000
Linear Codes over Finite Chain Rings.
Electron. J. Comb., 2000

1999
All Reed-Muller Codes Are Linearly Representable over the Ring of Dual Numbers over Z<sub>2</sub>.
IEEE Trans. Inf. Theory, 1999

1994
Doppeltzyklische Darstellungen von Quadratischen-Rest-Codes.
PhD thesis, 1994


  Loading...