| Publication | Date of Publication | Type |
|---|
Infinite families of few weight optimal binary linear codes from multivariable functions
IEEE Transactions on Information Theory | 2025-01-23 | Paper |
Characterization of weakly regular \(p\)-ary bent functions of \(\ell \)-form
Designs, Codes and Cryptography | 2024-10-14 | Paper |
Classification of binary combinatorial metrics which admit MacWilliam's extension theorem
IEEE Transactions on Information Theory | 2024-07-21 | Paper |
The Griesmer codes of Belov type and optimal quaternary codes via multi-variable functions
Cryptography and Communications | 2024-07-11 | Paper |
| MacWilliams-type identities on vectorial Boolean functions with bent components and applications | 2023-11-23 | Paper |
Optimal binary linear codes from posets of the disjoint union of two chains
Advances in Mathematics of Communications | 2023-07-07 | Paper |
Connection of \(p\)-ary \(t\)-weight linear codes to Ramanujan Cayley graphs with \(t+1\) eigenvalues
Advances in Mathematics of Communications | 2023-07-07 | Paper |
Characterization of \(p\)-ary functions in terms of association schemes and its applications
Journal of Combinatorial Theory. Series A | 2022-01-20 | Paper |
New LCD MDS Codes of Non-Reed-Solomon Type
IEEE Transactions on Information Theory | 2021-09-07 | Paper |
| Construction of two- or three-weight binary linear codes from Vasil'ev codes | 2021-07-23 | Paper |
Sharp conditions for the existence of an even \([a,b\)-factor in a graph]
(available as arXiv preprint) | 2021-06-03 | Paper |
Construction of minimal linear codes from multi-variable functions
Advances in Mathematics of Communications | 2021-05-12 | Paper |
Infinite Families of Optimal Linear Codes Constructed From Simplicial Complexes
IEEE Transactions on Information Theory | 2020-12-04 | Paper |
Optimal minimal linear codes from posets
Designs, Codes and Cryptography | 2020-11-11 | Paper |
Few-weight codes over \(\mathbb{F}_p + u \mathbb{F}_p\) associated with down sets and their distance optimal Gray image
Discrete Applied Mathematics | 2020-06-29 | Paper |
Ramanujan graphs and expander families constructed from \(p\)-ary bent functions
Designs, Codes and Cryptography | 2020-01-31 | Paper |
Weighted Posets and Digraphs Admitting the Extended Hamming Code to be a Perfect Code
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
A spectral characterisation of \( t \)-designs and its applications
Advances in Mathematics of Communications | 2019-07-04 | Paper |
| Binary optimal linear codes from posets of the disjoint union of two chains | 2019-06-27 | Paper |
Optimal non-projective linear codes constructed from down-sets
Discrete Applied Mathematics | 2019-02-08 | Paper |
| Inversion of the classical Radon transform on \(\mathbb{Z}^n_p\) | 2019-01-31 | Paper |
Characterization of <inline-formula> <tex-math notation="LaTeX">$p$ </tex-math> </inline-formula>-ary Bent Functions in Terms of Strongly Regular Graphs
IEEE Transactions on Information Theory | 2019-01-18 | Paper |
| Characterization of certain types of \(r\)-plateaued functions | 2018-12-12 | Paper |
Linear codes from simplicial complexes
Designs, Codes and Cryptography | 2018-09-06 | Paper |
A Bound on Equitable Partitions of the Hamming Space
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
MDS Poset-Codes Satisfying the Asymptotic Gilbert–Varshamov Bound in Hamming Weights
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Necessary Conditions for the Existence of Regular $p$-Ary Bent Functions
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
Explicit Criteria for Construction of Plateaued Functions
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
| The weighted poset metrics and directed graph metrics | 2017-03-01 | Paper |
Explicit criterions for \(p\)-ary functions being non-bent
Journal of Mathematical Analysis and Applications | 2015-09-30 | Paper |
Harmonic distributions for equitable partitions of a hypercube
Journal of Combinatorial Designs | 2015-08-11 | Paper |
Boolean functions with MacWilliams duality
Designs, Codes and Cryptography | 2014-06-27 | Paper |
Nonexistence of certain types of plateaued functions
Discrete Applied Mathematics | 2014-04-10 | Paper |
| New metrics arising from matroids of linear codes | 2014-04-07 | Paper |
Local duality theorem for \(q\)-ary 1-perfect codes
Designs, Codes and Cryptography | 2014-03-17 | Paper |
A Riemann hypothesis analogue for near-MDS codes
Discrete Applied Mathematics | 2012-10-19 | Paper |
Simple proofs for duality of generalized minimum poset weights and weight distributions of (near-)MDS poset codes
Advanced Studies in Contemporary Mathematics (Kyungshang) | 2012-09-09 | Paper |
| MacWilliams-type equivalence relations | 2012-05-04 | Paper |
MacWilliams duality and a Gleason-type theorem on self-dual bent functions
Designs, Codes and Cryptography | 2012-04-04 | Paper |
Local duality for equitable partitions of a Hamming space
Journal of Combinatorial Theory. Series A | 2011-12-23 | Paper |
A subgroup of the full poset-isometry group
SIAM Journal on Discrete Mathematics | 2011-04-15 | Paper |
Generalized MacWilliams identities and their applications to perfect binary codes
Designs, Codes and Cryptography | 2009-03-31 | Paper |
Maximum distance separable poset codes
Designs, Codes and Cryptography | 2009-03-31 | Paper |
Groups of linear isometries on poset structures
Discrete Mathematics | 2008-09-04 | Paper |
Linear discrepancy of the product of two chains
Order | 2006-05-02 | Paper |
The poset structures admitting the extended binary Hamming code to be a perfect code
Discrete Mathematics | 2005-01-13 | Paper |
