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

06/28/2019
by   Yansheng Wu, et al.
0

Recently, Chang and Hyun obtained some classes of binary optimal codes via simplicial complexes. In this letter, we utilize posets of the disjoint union of two chains to construct binary optimal linear codes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/27/2019

New quaternary codes derived from posets of the disjoint union of two chains

Based on the generic construction of linear codes, we construct linear c...
research
07/16/2021

Almost linear Boolean functions on S_n are almost unions of cosets

We show that if f S_n →{0,1} is ϵ-close to linear in L_2 and 𝔼[f] ≤ 1/2 ...
research
04/29/2021

To code, or not to code, at the racetrack: Kelly betting and single-letter codes

For a gambler with side information, Kelly betting gives the optimal log...
research
11/03/2017

PS-DBSCAN: An Efficient Parallel DBSCAN Algorithm Based on Platform Of AI (PAI)

We present PS-DBSCAN, a communication efficient parallel DBSCAN algorith...
research
12/30/2021

Feferman-Vaught Decompositions for Prefix Classes of First Order Logic

The Feferman-Vaught theorem provides a way of evaluating a first order s...
research
02/11/2018

Binary Pebbling Algorithms for In-Place Reversal of One-Way Hash Chains

We present optimal binary pebbling algorithms for in-place reversal (bac...
research
02/20/2020

Greedy weights for matroids

We introduce greedy weights of matroids, inspired by those for linear co...

Please sign up or login with your details

Forgot password? Click here to reset