Timothy Alderson
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Timothy Alderson has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
Keith E. Mellinger
5 shared publications- Aiden A. Bruen
University of Calgary
4 shared publications Benjamin Morine
2 shared publications- Keith E. Mellinger
University of Mary Washington
2 shared publications - Alessandro Neri
Department of Mathematics and Applications “R. Caccioppoli” University of Naples Federico II Monte Sant'Angelo Naples Italy
1 shared publication - András Gács
Eötvös Loránd University
1 shared publication
Latest Publications
- Open Access
- 18 October 2026
- Published by iPeak Academy Ltd. in Journal of Algebra Combinatorics Discrete Structures and Applications
- Vol. 14 (1) , 99-118
Projective systems and bounds on the length of codes of non-zero defect
We derive bounds on the lengths of linear codes with fixed Singleton defect, working within the framework of projective systems. This geometric perspective allows us to unify and extend a range of existing results. We study the maximum length of a non-degenerate linear code when its dimension, field order, and Singleton defect are fixed, and refine this question by also prescribing the defect of the dual code. We further investigate the maximum dimension in which a code can attain the general length bound. Among our main results, we provide sufficient conditions under which a code and its dual have equal Singleton defect, addressing a gap in the existing literature. We show that codes of sufficient length must be projective, meet the Griesmer bound, and have an almost maximum distance separable dual. Our bounds subsume or improve several results in the literature. For field orders greater than three, we propose two conjectures on length-maximal codes of dimension at least five, supported by computational evidence. Received: 05 May 2025 | Revised: 24 June 2026 | Accepted: 26 June 2026
- 18 October 2026
- Published by iPeak Academy Ltd. in Journal of Algebra Combinatorics Discrete Structures and Applications
- Vol. 14 (1) , 99-118
Open AccessProjective systems and bounds on the length of codes of non-zero defect
We derive bounds on the lengths of linear codes with fixed Singleton defect, working within the framework of projective systems. This geometric perspective allows us to unify and extend a range of existing results. We study the maximum length of a non-degenerate linear code when its dimension, field order, and Singleton defect are fixed, and refine this question by also prescribing the defect of the dual code. We further investigate the maximum dimension in which a code can attain the general length bound. Among our main results, we provide sufficient conditions under which a code and its dual have equal Singleton defect, addressing a gap in the existing literature. We show that codes of sufficient length must be projective, meet the Griesmer bound, and have an almost maximum distance separable dual. Our bounds subsume or improve several results in the literature. For field orders greater than three, we propose two conjectures on length-maximal codes of dimension at least five, supported by computational evidence. Received: 05 May 2025 | Revised: 24 June 2026 | Accepted: 26 June 2026
- 30 March 2026
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 94 (4) , 74
When arcs extend uniquely: a higher-dimensional generalization of Barlotti’s result
- 30 March 2026
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 94 (4) , 74
When arcs extend uniquely: a higher-dimensional generalization of Barlotti’s result
- Open Access
MWS and FWS Codes for Coordinate-Wise Weight Functions
A combinatorial problem concerning the maximum size of the (hamming) weight set of an $[n,k]_q$ linear code was recently introduced. Codes attaining the established upper bound are the Maximum Weight Spectrum (MWS) codes. Those $[n,k]_q $ codes with the same weight set as $ \mathbb{F}_q^n $ are called Full Weight Spectrum (FWS) codes. FWS codes are necessarily ``short", whereas MWS codes are necessarily ``long". For fixed $ k,q $ the values of $ n $ for which an $ [n,k]_q $-FWS code exists are completely determined, but the determination of the minimum length $ M(H,k,q) $ of an $ [n,k]_q $-MWS code remains an open problem. The current work broadens discussion first to general coordinate-wise weight functions, and then specifically to the Lee weight and a Manhattan like weight. In the general case we provide bounds on $ n $ for which an FWS code exists, and bounds on $ n $ for which an MWS code exists. When specializing to the Lee or to the Manhattan setting we are able to completely determine the parameters of FWS codes. As with the Hamming case, we are able to provide an upper bound on $ M(\mathcal{L},k,q) $ (the minimum length of Lee MWS codes), and pose the determination of $ M(\mathcal{L},k,q) $ as an open problem. On the other hand, with respect to the Manhattan weight we completely determine the parameters of MWS codes.Open AccessMWS and FWS Codes for Coordinate-Wise Weight Functions
A combinatorial problem concerning the maximum size of the (hamming) weight set of an $[n,k]_q$ linear code was recently introduced. Codes attaining the established upper bound are the Maximum Weight Spectrum (MWS) codes. Those $[n,k]_q $ codes with the same weight set as $ \mathbb{F}_q^n $ are called Full Weight Spectrum (FWS) codes. FWS codes are necessarily ``short", whereas MWS codes are necessarily ``long". For fixed $ k,q $ the values of $ n $ for which an $ [n,k]_q $-FWS code exists are completely determined, but the determination of the minimum length $ M(H,k,q) $ of an $ [n,k]_q $-MWS code remains an open problem. The current work broadens discussion first to general coordinate-wise weight functions, and then specifically to the Lee weight and a Manhattan like weight. In the general case we provide bounds on $ n $ for which an FWS code exists, and bounds on $ n $ for which an MWS code exists. When specializing to the Lee or to the Manhattan setting we are able to completely determine the parameters of FWS codes. As with the Hamming case, we are able to provide an upper bound on $ M(\mathcal{L},k,q) $ (the minimum length of Lee MWS codes), and pose the determination of $ M(\mathcal{L},k,q) $ as an open problem. On the other hand, with respect to the Manhattan weight we completely determine the parameters of MWS codes. - Open Access
- 19 May 2023
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 36 (2) , 367-385
MWS and FWS codes for coordinate-wise weight functions
- 19 May 2023
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 36 (2) , 367-385
Open AccessMWS and FWS codes for coordinate-wise weight functions
- 2 March 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 66 (9) , 5414-5418
On the Weights of General MDS Codes
The weight spectra of MDS codes of length n and dimension k over arbitrary alphabets are studied. For all q-ary MDS codes of dimension k and length n ≠ q + k – 1 containing the zero codeword, it is shown that all k weights from n to n – k + 1 are realized. The weight spectrum in the remaining case n = q + k–1 is also determined. Additionally, we prove that all binary MDS codes are equivalent to linear MDS codes. The proofs are combinatorial, and self contained.
- 2 March 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 66 (9) , 5414-5418
On the Weights of General MDS Codes
The weight spectra of MDS codes of length n and dimension k over arbitrary alphabets are studied. For all q-ary MDS codes of dimension k and length n ≠ q + k – 1 containing the zero codeword, it is shown that all k weights from n to n – k + 1 are realized. The weight spectrum in the remaining case n = q + k–1 is also determined. Additionally, we prove that all binary MDS codes are equivalent to linear MDS codes. The proofs are combinatorial, and self contained.
- Open Access
On the Weights of General MDS Codes
The weight spectra of MDS codes of length $ n $ and dimension $ k $ over the arbitrary alphabets are studied. For all $ q $-ary MDS codes of dimension $ k $ containing the zero codeword, it is shown that all $ k $ weights from $ n $ to $ n-k+1 $ are realized. The remaining case $ n=q+k-1 $ is also determined. Additionally, we prove that all binary MDS codes are equivalent to linear MDS codes. The proofs are combinatorial, and self contained.Open AccessOn the Weights of General MDS Codes
The weight spectra of MDS codes of length $ n $ and dimension $ k $ over the arbitrary alphabets are studied. For all $ q $-ary MDS codes of dimension $ k $ containing the zero codeword, it is shown that all $ k $ weights from $ n $ to $ n-k+1 $ are realized. The remaining case $ n=q+k-1 $ is also determined. Additionally, we prove that all binary MDS codes are equivalent to linear MDS codes. The proofs are combinatorial, and self contained. - Open Access
A note on full weight spectrum codes
A linear $ [n,k]_q $ code $ C $ is said to be a full weight spectrum (FWS) code if there exist codewords of each nonzero weight less than or equal to $ n $. In this brief communication we determine necessary and sufficient conditions for the existence of linear $ [n,k]_q $ full weight spectrum (FWS) codes. Central to our approach is the geometric view of linear codes, whereby columns of a generator matrix correspond to points in $ PG(k-1,q) $.Open AccessA note on full weight spectrum codes
A linear $ [n,k]_q $ code $ C $ is said to be a full weight spectrum (FWS) code if there exist codewords of each nonzero weight less than or equal to $ n $. In this brief communication we determine necessary and sufficient conditions for the existence of linear $ [n,k]_q $ full weight spectrum (FWS) codes. Central to our approach is the geometric view of linear codes, whereby columns of a generator matrix correspond to points in $ PG(k-1,q) $. - 19 January 2019
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 30 (5) , 373-386
n-dimensional optical orthogonal codes, bounds and optimal constructions
- 19 January 2019
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 30 (5) , 373-386
n-dimensional optical orthogonal codes, bounds and optimal constructions
- Open Access
- 1 January 2019
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 13 (1) , 101-119
Maximum weight spectrum codes
In the recent work [9], a combinatorial problem concerning linear codes over a finite field $\mathbb{F}_q$ was introduced. In that work the authors studied the weight set of an $[n,k]_q$ linear code, that is the set of non-zero distinct Hamming weights, showing that its cardinality is bounded above by $\frac{q^k-1}{q-1}$. They showed that this bound was sharp in the case $ q = 2 $, and in the case $ k = 2 $. They conjectured that the bound is sharp for every prime power $ q $ and every positive integer $ k $. In this work we quickly establish the truth of this conjecture. We provide two proofs, each employing different construction techniques. The first relies on the geometric view of linear codes as systems of projective points. The second approach is purely algebraic. We establish some lower bounds on the length of codes that satisfy the conjecture, and the length of the new codes constructed here are discussed.- 1 January 2019
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 13 (1) , 101-119
Open AccessMaximum weight spectrum codes
In the recent work [9], a combinatorial problem concerning linear codes over a finite field $\mathbb{F}_q$ was introduced. In that work the authors studied the weight set of an $[n,k]_q$ linear code, that is the set of non-zero distinct Hamming weights, showing that its cardinality is bounded above by $\frac{q^k-1}{q-1}$. They showed that this bound was sharp in the case $ q = 2 $, and in the case $ k = 2 $. They conjectured that the bound is sharp for every prime power $ q $ and every positive integer $ k $. In this work we quickly establish the truth of this conjecture. We provide two proofs, each employing different construction techniques. The first relies on the geometric view of linear codes as systems of projective points. The second approach is purely algebraic. We establish some lower bounds on the length of codes that satisfy the conjecture, and the length of the new codes constructed here are discussed.