Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Designs, Codes and Cryptography
Published in: Designs, Codes and Cryptography 12/2023

07-08-2023

Construction of storage codes of rate approaching one on triangle-free graphs

Authors: Hexiang Huang, Qing Xiang

Published in: Designs, Codes and Cryptography | Issue 12/2023

Login to get access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Consider an assignment of bits to the vertices of a connected graph \(\Gamma (V, E)\) with the property that the value of each vertex is a function of the values of its neighbors. A collection of such assignments is called a storage code of length |V| on \(\Gamma \). In this paper we construct an infinite family of linear storage codes on triangle-free graphs with rates arbitrarily close to one.
previous article Structural evaluation of AES-like ciphers against mixture differential cryptanalysis
next article Private simultaneous messages based on quadratic residues
Literature
1.
2.
Barg A., Zémor G.: High-rate storage codes on triangle-free graphs. IEEE Trans. Inf. Theory 68(12), 7787–7797 (2021).MathSciNetCrossRef
3.
4.
Cameron P.J., Dang A.N., Riis S.: Guessing games on triangle-free graphs. Electron. J. Comb. 23(1), 15 (2016).MathSciNetMATH
5.
6.
7.
Mazumdar A., McGregor A., Vorotnikova S.: Storage capacity as an information theoretic vertex cover and the index coding rate. IEEE Trans. Inform. Theory 65(9), 5580–5591 (2019).MathSciNetCrossRefMATH
8.
Shanmugam, K., Dimakis, A. G.: Bounding multiple unicasts through index coding and Locally Repairable Codes. IEEE International Symposium on Information Theory: 296–300. (2014)
Metadata
Title
Construction of storage codes of rate approaching one on triangle-free graphs
Authors
Hexiang Huang
Qing Xiang
Publication date
07-08-2023
Publisher
Springer US
Published in
Designs, Codes and Cryptography / Issue 12/2023
Print ISSN: 0925-1022
Electronic ISSN: 1573-7586
DOI
https://doi.org/10.1007/s10623-023-01278-6

Other articles of this Issue 12/2023

Designs, Codes and Cryptography 12/2023 Go to the issue

OriginalPaper

Private simultaneous messages based on quadratic residues

OriginalPaper

Optimal Ferrers diagram rank-metric codes from MRD codes

OriginalPaper

Scheduling to reduce close contacts: resolvable grid graph decomposition and packing

OriginalPaper

Individual discrete logarithm with sublattice reduction

OriginalPaper

On the fourth weight of generalized Reed–Muller codes

OriginalPaper

Skew differential Goppa codes and their application to Mceliece cryptosystem

Premium Partner

    Image Credits