Hyun Kwang Kim

Jieun Kwon

Des. Codes Cryptogr., 2022

2020

Optimal minimal linear codes from posets.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2020

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

2018

Improved linear programming bound on sizes of doubly constant-weight codes.

[BibT_eX]

[DOI]

Jaeseon Kim

Finite Fields Their Appl., 2018

2014

New inequalities for $$q$$ q -ary constant-weight codes.

[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

Improved Semidefinite Programming Bound on Sizes of Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

2012

Delsarte's Linear Programming Bound for Constant-Weight Codes.

[BibT_eX]

[DOI]

Byung Gyun Kang

IEEE Trans. Inf. Theory, 2012

Structures and lower bounds for binary covering arrays.

[BibT_eX]

[DOI]

Soohak Choi

Discret. Math., 2012

Type I Codes over GF(4).

[BibT_eX]

Dae-Kyu Kim

Jon-Lark Kim

Ars Comb., 2012

2011

Improved Linear Programming Bounds on Sizes of Constant-Weight Codes

[BibT_eX]

[DOI]

Byung Gyun Kang

CoRR, 2011

2010

Optimal single deletion correcting code of length four over an alphabet of even size.

[BibT_eX]

[DOI]

Joon Yop Lee

IEEE Trans. Inf. Theory, 2010

Construction of optimal codes in deletion and insertion metric

[BibT_eX]

[DOI]

Joon Yop Lee

CoRR, 2010

2009

Errata to "Evaluation of zeta function of the simplest cubic field at negative odd integers".

[BibT_eX]

[DOI]

Math. Comput., 2009

2008

The Poset Metrics That Allow Binary Codes of Codimension m -, (m-1)-, or (m-2)-Perfect.

[BibT_eX]

[DOI]

Denis S. Krotov

IEEE Trans. Inf. Theory, 2008

Groups of linear isometries on poset structures.

[BibT_eX]

[DOI]

Discret. Math., 2008

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

[BibT_eX]

[DOI]

Discret. Math., 2008

Preface.

[BibT_eX]

[DOI]

Discret. Math., 2008

Maximum distance separable poset codes.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2008

2007

Uniqueness of some optimal superimposed codes.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2007

The poset metrics that allow binary codes of codimension m to be m-, (m - 1)-, or (m - 2)-perfect.

[BibT_eX]

[DOI]

Denis S. Krotov

Proceedings of the IEEE International Symposium on Information Theory, 2007

2005

A classification of posets admitting the MacWilliams identity.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

On the nonexistence of triple-error-correcting perfect binary linear codes with a crown poset structure.

[BibT_eX]

[DOI]

Discret. Math., 2005

2004

On the Optimality of Trivial (<i>w</i>, <i>r</i>)-Cover-Free Codes.

[BibT_eX]

[DOI]

Vladimir S. Lebedev

Probl. Inf. Transm., 2004

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

[BibT_eX]

[DOI]

Discret. Math., 2004

2003

Classification of perfect linear codes with crown poset structure.

[BibT_eX]

[DOI]

Discret. Math., 2003

2002

Evaluation of zeta function of the simplest cubic field at negative odd integers.

[BibT_eX]

[DOI]