Jong Yoon Hyun

Nayoung Han

Cryptogr. Commun., May, 2024

2023

Classification of Binary Combinatorial Metrics Which Admit MacWilliam's Extension Theorem.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, December, 2023

Connection of $ p $-ary $ t $-weight linear codes to Ramanujan Cayley graphs with $ t+1 $ eigenvalues.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2023

2022

Characterization of p-ary functions in terms of association schemes and its applications.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2022

Optimal binary linear codes from posets of the disjoint union of two chains.

[BibT_eX]

[DOI]

Qin Yue

Adv. Math. Commun., 2022

2021

New LCD MDS Codes of Non-Reed-Solomon Type.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Construction of minimal linear codes from multi-variable functions.

[BibT_eX]

[DOI]

Boran Kim

Minwon Na

Adv. Math. Commun., 2021

2020

Infinite Families of Optimal Linear Codes Constructed From Simplicial Complexes.

[BibT_eX]

[DOI]

Jungyun Lee

IEEE Trans. Inf. Theory, 2020

Ramanujan graphs and expander families constructed from p-ary bent functions.

[BibT_eX]

[DOI]

Jungyun Lee

Des. Codes Cryptogr., 2020

Optimal minimal linear codes from posets.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2020

Few-weight codes over Fp+uFp associated with down sets and their distance optimal Gray image.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

2019

Characterization of p-ary Bent Functions in Terms of Strongly Regular Graphs.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Weighted Posets and Digraphs Admitting the Extended Hamming Code to be a Perfect Code.

[BibT_eX]

[DOI]

Jeong Rye Park

IEEE Trans. Inf. Theory, 2019

Optimal non-projective linear codes constructed from down-sets.

[BibT_eX]

[DOI]

Minwon Na

Discret. Appl. Math., 2019

Few-weight codes over F<sub>p</sub>+uF<sub>p</sub> associated with down sets and their distance optimal Gray image.

[BibT_eX]

[DOI]

CoRR, 2019

Binary optimal linear codes from posets of the disjoint union of two chains.

[BibT_eX]

[DOI]

Qin Yue

CoRR, 2019

A spectral characterisation of t-designs and its applications.

[BibT_eX]

[DOI]

Eun-Kyung Cho

Cunsheng Ding

Adv. Math. Commun., 2019

2018

Linear codes from simplicial complexes.

[BibT_eX]

[DOI]

Seunghwan Chang

Des. Codes Cryptogr., 2018

2016

Explicit Criteria for Construction of Plateaued Functions.

[BibT_eX]

[DOI]

Jungyun Lee

IEEE Trans. Inf. Theory, 2016

2014

Necessary Conditions for the Existence of Regular p -Ary Bent Functions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Boolean functions with MacWilliams duality.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2014

Local duality theorem for q-ary 1-perfect codes.

[BibT_eX]

[DOI]

Soohak Choi

Des. Codes Cryptogr., 2014

2013

Nonexistence of certain types of plateaued functions.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

2012

Local duality for equitable partitions of a Hamming space.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2012

MacWilliams duality and a Gleason-type theorem on self-dual bent functions.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2012

A Riemann hypothesis analogue for near-MDS codes.

[BibT_eX]

[DOI]

Dong Chan Kim

Discret. Appl. Math., 2012

2011

MDS Poset-Codes Satisfying the Asymptotic Gilbert-Varshamov Bound in Hamming Weights.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Simple proofs for duality of generalized minimum poset weights and weight distributions of (Near-)MDS poset codes

[BibT_eX]

[DOI]

Dae San Kim

Dong Chan Kim

CoRR, 2011

2010

A bound on equitable partitions of the hamming space.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

A Subgroup of the Full Poset-Isometry Group.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

2009

Generalized MacWilliams identities and their applications to perfect binary codes.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2009

2008

Groups of linear isometries on poset structures.

[BibT_eX]

[DOI]

Discret. Math., 2008

Maximum distance separable poset codes.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2008

2004

The poset structures admitting the extended binary Hamming code to be a perfect code.

[BibT_eX]

[DOI]