A graphical representation of binary linear codes

05/21/2022
βˆ™
by   Lisbeth Danyeli Delgado OrdoΓ±ez, et al.
βˆ™
0
βˆ™

A binary [n,k]-linear code π’ž is a k-dimensional subspace of 𝔽_2^n. For xβˆˆπ”½_2^n, the set x+π’ž is a coset of π’ž. In this work we study a partial ordering on the set of cosets of a binary linear code π’ž of length n and we construct a graph using the orphan structure of this code.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
βˆ™ 06/18/2020

No projective 16-divisible binary linear code of length 131 exists

We show that no projective 16-divisible binary linear code of length 131...
research
βˆ™ 12/14/2018

The lengths of projective triply-even binary codes

It is shown that there does not exist a binary projective triply-even co...
research
βˆ™ 09/26/2019

Higher-Dimensional Potential Heuristics for Optimal Classical Planning

Potential heuristics for state-space search are defined as weighted sums...
research
βˆ™ 10/02/2008

Optimizing Binary Code Produced by Valgrind (Project Report on Virtual Execution Environments Course - AVExe)

Valgrind is a widely used framework for dynamic binary instrumentation a...
research
βˆ™ 08/10/2019

RISC-V: #AlphanumericShellcoding

We explain how to design RISC-V shellcodes capable of running arbitrary ...
research
βˆ™ 05/16/2020

Reconstruction of Multi-user Binary Subspace Chirps

We consider codebooks of Complex Grassmannian Lines consisting of Binary...
research
βˆ™ 06/04/2018

On the computational complexity of blind detection of binary linear codes

In this work, we study the computational complexity of the Minimum Dista...

Please sign up or login with your details

Forgot password? Click here to reset