default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Honold
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j20]Thomas Honold, Ivan N. Landjev:
On homogeneous arcs and linear codes over finite chain rings. Appl. Algebra Eng. Commun. Comput. 34(3): 359-375 (2023)- [j19]Thomas Honold, Uwe Schauz
:
Transformation invariance in the Combinatorial Nullstellensatz and nowhere-zero points of non-singular matrices. Discret. Math. 346(11): 113187 (2023) - 2021
- [j18]Minjia Shi, Thomas Honold, Patrick Solé, Yunzhen Qiu, Rongsheng Wu, Zahra Sepasdar:
The Geometry of Two-Weight Codes Over ℤpm. IEEE Trans. Inf. Theory 67(12): 7769-7781 (2021) - 2020
- [j17]Thomas Honold, Michael Kiermaier, Sascha Kurz, Alfred Wassermann:
The Lengths of Projective Triply-Even Binary Codes. IEEE Trans. Inf. Theory 66(5): 2713-2716 (2020) - [c9]Thomas Honold, Michael Kiermaier, Ivan N. Landjev:
New upper bounds on the maximal size of an arc in a projective Hjelmslev plane. ACCT 2020: 1-10
2010 – 2019
- 2019
- [j16]Daniel Heinlein, Thomas Honold, Michael Kiermaier, Sascha Kurz:
Generalized vector space partitions. Australas. J Comb. 73: 162-178 (2019) - [j15]Thomas Honold, Michael Kiermaier, Sascha Kurz:
Johnson Type Bounds for Mixed Dimension Subspace Codes. Electron. J. Comb. 26(3): 3 (2019) - [j14]Daniel Heinlein, Thomas Honold, Michael Kiermaier, Sascha Kurz, Alfred Wassermann:
Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6. Des. Codes Cryptogr. 87(2-3): 375-391 (2019) - 2018
- [i11]Thomas Honold, Michael Kiermaier, Sascha Kurz, Alfred Wassermann:
The lengths of projective triply-even binary codes. CoRR abs/1812.05957 (2018) - 2017
- [i10]Oliver W. Gnilke, Marcus Greferath, Thomas Honold, Jay A. Wood, Jens Zumbrägel:
The Extension Theorem for Bi-invariant Weights over Frobenius Rings and Frobenius Bimodules. CoRR abs/1711.09939 (2017) - 2016
- [j13]Thomas Honold, Michael Kiermaier, Sascha Kurz:
Constructions and bounds for mixed-dimension subspace codes. Adv. Math. Commun. 10(3): 649-682 (2016) - [c8]Shengtian Yang, Thomas Honold, Zhaoyang Zhang:
Beyond countable alphabets: An extension of the information-spectrum approach. WCSP 2016: 1-5 - [i9]Jingmei Ai, Thomas Honold, Haiteng Liu:
The Expurgation-Augmentation Method for Constructing Good Plane Subspace Codes. CoRR abs/1601.01502 (2016) - [i8]Shengtian Yang, Thomas Honold, Zhaoyang Zhang:
Beyond Countable Alphabets: An Extension of the Information-Spectrum Approach. CoRR abs/1602.00376 (2016) - 2015
- [i7]Thomas Honold, Michael Kiermaier, Sascha Kurz:
Constructions and Bounds for Mixed-Dimension Subspace Codes. CoRR abs/1512.06660 (2015) - 2014
- [j12]Marcus Greferath, Thomas Honold, Cathy Mc Fadden, Jay A. Wood, Jens Zumbrägel:
MacWilliams' Extension Theorem for bi-invariant weights over finite principal ideal rings. J. Comb. Theory A 125: 177-193 (2014) - [j11]Shengtian Yang, Thomas Honold, Yan Chen, Zhaoyang Zhang, Peiliang Qiu:
Constructing Linear Encoders With Good Spectra. IEEE Trans. Inf. Theory 60(10): 5950-5965 (2014) - [c7]Haiteng Liu, Thomas Honold:
Poster: A new approach to the Main Problem of Subspace Coding. ChinaCom 2014: 676-677 - 2013
- [j10]Thomas Honold, Ivan N. Landjev:
Non-free extensions of the simplex codes over a chain ring with four elements. Des. Codes Cryptogr. 66(1-3): 27-38 (2013) - [j9]Thomas Honold, Michael Kiermaier:
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. 68(1-3): 105-126 (2013) - [i6]Marcus Greferath, Thomas Honold, Cathy Mc Fadden, Jay A. Wood, Jens Zumbrägel:
MacWilliams' Extension Theorem for Bi-Invariant Weights over Finite Principal Ideal Rings. CoRR abs/1309.3292 (2013) - 2012
- [j8]Shengtian Yang, Thomas Honold:
Good random matrices over finite fields. Adv. Math. Commun. 6(2): 203-227 (2012) - 2011
- [j7]Thomas Honold, Ivan N. Landjev:
The dual construction for arcs in projective Hjelmslev spaces. Adv. Math. Commun. 5(1): 11-21 (2011) - [j6]Shengtian Yang, Thomas Honold, Yan Chen, Zhaoyang Zhang, Peiliang Qiu:
Weight Distributions of Regular Low-Density Parity-Check Codes Over Finite Fields. IEEE Trans. Inf. Theory 57(11): 7507-7521 (2011) - [c6]Yimin Pang, Thomas Honold:
An upper bound on broadcast subspace codes. CHINACOM 2011: 1155-1158 - [c5]Yimin Pang, Thomas Honold:
Towards the capacity region of multiplicative linear operator broadcast channels. ITW 2011: 703-707 - [i5]Yimin Pang, Thomas Honold:
An Upper Bound on Broadcast Subspace Codes. CoRR abs/1110.3855 (2011) - 2010
- [i4]Shengtian Yang, Thomas Honold, Yan Chen, Zhaoyang Zhang, Peiliang Qiu:
Weight Distributions of Regular Low-Density Parity-Check Codes over Finite Fields. CoRR abs/1010.2030 (2010) - [i3]Yimin Pang, Thomas Honold:
Towards the Capacity Region of Multiplicative Linear Operator Broadcast Channels. CoRR abs/1012.5774 (2010)
2000 – 2009
- 2009
- [c4]Zhimin Yang, Shiju Li, Hao Feng, Thomas Honold, Guanding Yu:
Cross-layer iterative decoding of irregular LDPC codes using cyclic redundancy check codes. WCNC 2009: 942-947 - [i2]Shengtian Yang, Thomas Honold, Yan Chen, Zhaoyang Zhang, Peiliang Qiu:
Constructing Linear Codes with Good Spectra. CoRR abs/0909.3131 (2009) - 2008
- [j5]Eimear Byrne, Marcus Greferath, Thomas Honold:
Ring geometries, two-weight codes, and strongly regular graphs. Des. Codes Cryptogr. 48(1): 1-16 (2008) - [c3]Tina Mattes, Frank Schiller, Annemarie Mörwald, Thomas Honold:
Analysis of Nested CRC with Additional Net Data in Communication. SAFECOMP 2008: 126-138 - [c2]Tina Mattes, Frank Schiller, Jörg Pfahler, Annemarie Mörwald, Thomas Honold:
Nachweis der Güte von Kombinationen des CRC. Sicherheit 2008: 355-366 - [i1]Shengtian Yang, Yan Chen, Thomas Honold, Zhaoyang Zhang, Peiliang Qiu:
Constructing Linear Codes with Good Joint Spectra. CoRR abs/0802.1555 (2008) - 2007
- [c1]Tina Mattes, Jörg Pfahler, Frank Schiller, Thomas Honold:
Analysis of Combinations of CRC in Industrial Communication. SAFECOMP 2007: 329-341 - 2005
- [j4]Thomas Honold, Ivan N. Landjev:
On maximal arcs in projective Hjelmslev planes over chain rings of even characteristic. Finite Fields Their Appl. 11(2): 292-304 (2005) - 2001
- [j3]Thomas Honold, Ivan N. Landjev:
On arcs in projective Hjelmslev planes. Discret. Math. 231(1-3): 265-278 (2001) - 2000
- [j2]Thomas Honold, Ivan N. Landjev:
Linear Codes over Finite Chain Rings. Electron. J. Comb. 7 (2000)
1990 – 1999
- 1999
- [j1]Thomas Honold, Ivan N. Landjev:
All Reed-Muller Codes Are Linearly Representable over the Ring of Dual Numbers over Z2. IEEE Trans. Inf. Theory 45(2): 700-701 (1999) - 1994
- [b1]Thomas Honold:
Doppeltzyklische Darstellungen von Quadratischen-Rest-Codes. Technical University Munich, Germany, 1994, pp. 1-163
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:15 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
