Optimal minimal linear codes from posets

DOI10.1007/s10623-020-00793-0zbMath1478.94124arXiv2008.07212OpenAlexW3084531141MaRDI QIDQ2211330

Qin Yue, Hyun Kwang Kim, Jong Yoon Hyun, Yansheng Wu

Publication date: 11 November 2020

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2008.07212

zbMATH Keywords

posetweight distributionminimal binary linear codeoptimal binary linear code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Boolean functions (06E30) Algebraic aspects of posets (06A11)

Related Items

Few-weight codes over a non-chain ring associated with simplicial complexes and their distance optimal gray image, Few-weight quaternary codes via simplicial complexes, New classes of binary few weight codes from trace codes over a chain ring, Octanary linear codes using simplicial complexes, Optimal binary linear codes from posets of the disjoint union of two chains, Minimal and optimal binary codes obtained using \(C_D\)-construction over the non-unital ring \(I\)

Cites Work

• Unnamed Item
• A construction of binary linear codes from Boolean functions
• Linear codes with few weights from weakly regular bent functions based on a generic construction
• Linear codes from simplicial complexes
• Weight enumerators of reducible cyclic codes and their dual codes
• Minimal linear codes over finite fields
• Few-weight codes over \(\mathbb{F}_p + u \mathbb{F}_p\) associated with down sets and their distance optimal Gray image
• Complete weight enumerators of a class of linear codes with two or three weights
• On Minimal and Quasi-minimal Linear Codes
• Towards Secure Two-Party Computation from the Wire-Tap Channel
• Searching for linear codes with large minimum distance
• Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
• Secret sharing schemes from three classes of linear codes
• Fundamentals of Error-Correcting Codes
• Minimal Binary Linear Codes
• Minimal vectors in linear codes
• Optimal Few-Weight Codes From Simplicial Complexes
• Infinite Families of Optimal Linear Codes Constructed From Simplicial Complexes
• Minimal Linear Codes in Odd Characteristic
• A Bound for Error-Correcting Codes
• Upper and lower bounds on maximum nonlinearity of \(n\)-input \(m\)-output Boolean function