activity
20122024
most citedSome Bounds on Binary LCD Codes

4 citations · 7 across the 12 of their papers we have counts for

collaborators
Showing cs.ITShow all

7 papers · 1 filter

cs.IT20221 cited

Additive complementary dual codes over $\F_4$

Minjia Shi, Na Liu, Jon-Lark Kim +1

A linear code is linear complementary dual (LCD) if it meets its dual trivially. LCD codes have been a hot topic recently due to Boolean masking application in the security of emba…

cs.IT2017

Secret sharing schemes based on additive codes over

Jon-Lark Kim, Nari Lee

A secret sharing scheme (SSS) was introduced by Shamir in 1979 using polynomial interpolation. Later it turned out that it is equivalent to an SSS based on a Reed-Solomon code. SSS…

cs.IT2017

A Projection Decoding of a Binary Extremal Self-Dual Code of Length

Jon-Lark Kim, Nari Lee

As far as we know, there is no decoding algorithm of any binary self-dual code except for the syndrome decoding applied to the code directly. This syndrome decoding f…

cs.IT20174 cited

Some Bounds on Binary LCD Codes

Lucky Galvez, Jon-Lark Kim, Nari Lee +2

A linear code with a complementary dual (or LCD code) is defined to be a linear code whose dual code satisfies = . Le…

cs.IT2014

Higher-order CIS codes

Claude Carlet, Finley Freibert, Sylvain Guilley +3

We introduce {\bf complementary information set codes} of higher-order. A binary linear code of length and dimension is called a complementary information set code of orde…

cs.IT20121 cited

Optimum Subcodes of Self-Dual Codes and Their Optimum Distance Profiles

Finley Freibert, Jon-Lark Kim

Binary optimal codes often contain optimal or near-optimal subcodes. In this paper we show that this is true for the family of self-dual codes. One approach is to compute the optim…