Symmetry Implies Isomorphism for Certain Maximum Length Circuit Codes

01/03/2021
by   Kevin M. Byrnes, et al.
0

A classic result due to Douglas establishes that, for odd spread k and dimension d=1/2(3k+3), all maximum length (d,k) circuit codes are isomorphic. Using a recent result of Byrnes we extend Douglas's theorem to prove that, for k even ≥ 4 and d=1/2(3k+4), all maximum length symmetric (d,k) circuit codes are isomorphic.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/11/2020

The Maximum Length and Isomorphism of Circuit Codes with Long Bit Runs

Recently, Byrnes presented a formula for the maximum length of a symmetr...
research
09/22/2018

The Maximum Length of Circuit Codes With Long Bit Runs and a New Characterization Theorem

We study circuit codes with long bit runs (sequences of distinct transit...
research
09/22/2018

Further Results on Circuit Codes

We present a new characterization of circuit codes of spread k based on ...
research
06/13/2020

On Optimal Finite-length Binary Codes of Four Codewords for Binary Symmetric Channels

Finite-length binary codes of four codewords are studied for memoryless ...
research
02/21/2018

Non-Malleable Codes for Small-Depth Circuits

We construct efficient, unconditional non-malleable codes that are secur...
research
01/18/2022

The maximum cardinality of trifferent codes with lengths 5 and 6

A code 𝒞⊆{0, 1, 2}^n is said to be trifferent with length n when for any...
research
07/24/2023

In search of maximum non-overlapping codes

Non-overlapping codes are block codes that have arisen in diverse contex...

Please sign up or login with your details

Forgot password? Click here to reset