Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Near-Extremal Type I Self-Dual Codes with Minimal Shadow over GF(2) and GF(4)
View through CrossRef
Binary self-dual codes and additive self-dual codes over GF(4) contain common points. Both have Type I codes and Type II codes, as well as shadow codes. In this paper, we provide a comprehensive description of extremal and near-extremal Type I codes over GF(2) and GF(4) with minimal shadow. In particular, we prove that there is no near-extremal Type I [24m,12m,2m+2] binary self-dual code with minimal shadow if m≥323, and we prove that there is no near-extremal Type I (6m+1,26m+1,2m+1) additive self-dual code over GF(4) with minimal shadow if m≥22.
Title: Near-Extremal Type I Self-Dual Codes with Minimal Shadow over GF(2) and GF(4)
Description:
Binary self-dual codes and additive self-dual codes over GF(4) contain common points.
Both have Type I codes and Type II codes, as well as shadow codes.
In this paper, we provide a comprehensive description of extremal and near-extremal Type I codes over GF(2) and GF(4) with minimal shadow.
In particular, we prove that there is no near-extremal Type I [24m,12m,2m+2] binary self-dual code with minimal shadow if m≥323, and we prove that there is no near-extremal Type I (6m+1,26m+1,2m+1) additive self-dual code over GF(4) with minimal shadow if m≥22.
Related Results
When Does a Dual Matrix Have a Dual Generalized Inverse?
When Does a Dual Matrix Have a Dual Generalized Inverse?
This paper deals with the existence of various types of dual generalized inverses of dual matrices. New and foundational results on the necessary and sufficient conditions for vari...
Escaping the Shadow
Escaping the Shadow
Photo by Karl Raymund Catabas on Unsplash
The interests of patients at most levels of policymaking are represented by a disconnected patchwork of groups … “After Buddha was dead, ...
Generalised array low‐density parity‐check codes
Generalised array low‐density parity‐check codes
In this study, using Group Permutation Low‐Density Parity‐Check (GP‐LDPC) codes, the authors generalise the concept of array Low‐Density Parity‐Check (LDPC) codes from fields of pr...
PENGENALPASTIAN KARAKTER TIDAK BERNAMA WAYANG KULIT DI MUZIUM SENI ASIA UNIVERSITI MALAYA IDENTIFICATION OF UNNAMED SHADOW PUPPET CHARACTERS AT THE UNIVERSITY MALAYA ASIAN ART MUSEUM
PENGENALPASTIAN KARAKTER TIDAK BERNAMA WAYANG KULIT DI MUZIUM SENI ASIA UNIVERSITI MALAYA IDENTIFICATION OF UNNAMED SHADOW PUPPET CHARACTERS AT THE UNIVERSITY MALAYA ASIAN ART MUSEUM
Abstract
ABSTRAK
Wayang kulit terdiri daripada pelbagai bentuk dan wataknya yang berbeza-beza dari satu kawasan dan peredaran masa yang berlaku terhadap watak yang dihasilkan. ...
Increased life expectancy of heart failure patients in a rural center by a multidisciplinary program
Increased life expectancy of heart failure patients in a rural center by a multidisciplinary program
Abstract
Funding Acknowledgements
Type of funding sources: None.
INTRODUCTION Patients with heart failure (HF)...
SELF-ESTEEM AND SELF-EFFICACY AMONG NEWSCASTERS AND NEWS REPORTERS
SELF-ESTEEM AND SELF-EFFICACY AMONG NEWSCASTERS AND NEWS REPORTERS
The present study aimedto investigaterelationship between self-esteem and self-efficacy among news casters and news reporters and to compare both groups in self-esteemand self-effi...
The Automedial Zaniness of Ryan Trecartin
The Automedial Zaniness of Ryan Trecartin
IntroductionThe American artist Ryan Trecartin makes digital videos that centre on the self-presentations common to video-sharing sites such as YouTube. Named by New Yorker critic ...
Quasi~λ-cyclic Codes Over a Class of Finite Commutative Semi-simple Rings
Quasi~λ-cyclic Codes Over a Class of Finite Commutative Semi-simple Rings
Abstract
In coding theory, quasi λ-cyclic codes form an important class of codes which have been extensively studied. In this paper, we investigate the algebraic structure ...