Clique-Based Deletion-Correcting Codes via Penalty-Guided Clique Search

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Pandav, Aniruddh, Bhat, Rajshekhar V
Format:	Preprint
Published:	2026
Subjects:	Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Non-Linear Precoding via Dirty Paper Coding for Near-Field Downlink MISO Communications
by: Kulkarni, Akash, et al.
Published: (2025)

LLM-Guided Search for Deletion-Correcting Codes
by: Weindel, Franziska, et al.
Published: (2025)

Learning Short Codes for Fading Channels with No or Receiver-Only Channel State Information
by: Pomaje, Rishabh Sharad, et al.
Published: (2024)

Order Optimal Task Allocation in Distributed Computing via Interweaved Cliques
by: Maheri, Javad, et al.
Published: (2026)

Version AoI Optimization under Power and General Distortion Constraints in Uplink NOMA
by: Karevvanavar, Gangadhar, et al.
Published: (2026)

Design of Minimum Correlated, Maximal Clique Sets of One-Dimensional Uni-polar (Optical) Orthogonal Codes
by: Chauhan, Ram Chandra Singh, et al.
Published: (2013)

Insertion Correcting Capability for Quantum Deletion-Correcting Codes
by: Nakamura, Ken, et al.
Published: (2026)

Decoding Algorithm to Composite Errors Consisting of Deletions and Insertions for Quantum Deletion-Correcting Codes Based on Quantum Reed-Solomon Codes
by: Sasaki, Koki, et al.
Published: (2026)

Multiset Deletion-Correcting Codes: Bounds and Constructions
by: Kreindel, Avraham, et al.
Published: (2026)

Two-Insertion/Deletion/Substitution Correcting Codes
by: Pi, Yuhang, et al.
Published: (2024)

Function-Correcting Codes for Insertion-Deletion Channel
by: Singh, Anamika, et al.
Published: (2025)

Age of Information Minimization in Goal-Oriented Communication with Processing and Cost of Actuation Error Constraints
by: Pomaje, Rishabh S., et al.
Published: (2025)

Codes Correcting Two Bursts of Exactly $b$ Deletions
by: Ye, Zuo, et al.
Published: (2024)

Error Correcting Codes for Segmented Burst-Deletion Channels
by: Liu, Yajuan, et al.
Published: (2025)

Fastest Mixing Reversible Markov Chain: Clique Lifted Graphs and Subgraphs
by: Jafarizadeh, Saber
Published: (2025)

Maximum Degree-Based Quasi-Clique Search via an Iterative Framework
by: Xia, Hongbo, et al.
Published: (2025)

Coding for Composite DNA to Correct Substitutions, Strand Losses, and Deletions
by: Walter, Frederik, et al.
Published: (2024)

Binary Reconstruction Codes for Correcting One Deletion and One Substitution
by: Li, Yuling, et al.
Published: (2025)

Version Age of Information Minimization over Fading Broadcast Channels
by: Karevvanavar, Gangadhar, et al.
Published: (2023)

Semantic Text Transmission via Prediction with Small Language Models: Cost-Similarity Trade-off
by: Madhabhavi, Bhavani A, et al.
Published: (2024)

Criss-Cross Deletion Correcting Codes: Optimal Constructions with Efficient Decoders
by: Sun, Yubo, et al.
Published: (2025)

Optimal Two-Dimensional Reed--Solomon Codes Correcting Insertions and Deletions
by: Con, Roni, et al.
Published: (2023)

Upper Bounds on Multiple $b$-Burst Deletion-Correcting Codes
by: Wang, Chen, et al.
Published: (2026)

New Construction of $q$-ary Codes Correcting a Burst of at most $t$ Deletions
by: Song, Wentu, et al.
Published: (2024)

Correcting Bursty/Localized Deletions: A New Error-Position-Estimation Code
by: Ye, Zuo, et al.
Published: (2025)

Permutation and Multi-permutation Codes Correcting Multiple Deletions
by: Wang, Shuche, et al.
Published: (2024)

A New Construction of Non-Binary Deletion Correcting Codes and their Decoding
by: Schaller, Michael, et al.
Published: (2025)

Polynomial Constructions and Deletion-Ball Geometry for Multiset Deletion Codes
by: Kreindel, Avraham, et al.
Published: (2026)

The Lovász Theta Function for Recovering Planted Clique Covers and Graph Colorings
by: Hou, Jiaxin, et al.
Published: (2023)

Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions
by: Blocki, Jeremiah, et al.
Published: (2021)

Correcting Errors Through Partitioning and Burst-Deletion Correction
by: Sun, Yubo, et al.
Published: (2025)

Error-Correcting Codes for Two Bursts of t1-Deletion-t2-Insertion with Low Computational Complexity
by: Liu, Yajuan, et al.
Published: (2026)

Decoding Algorithm Correcting Single-Insertion Plus Single-Deletion for Non-binary Quantum Codes
by: Nakamura, Ken, et al.
Published: (2024)

Oblivious Deletion Codes
by: Con, Roni, et al.
Published: (2025)

Clique counts for network similarity
by: Bonato, Anthony, et al.
Published: (2024)

Improved Constructions of Linear Codes for Insertions and Deletions
by: Gross, Roee, et al.
Published: (2025)

A Deep Learning Based Decoder for Concatenated Coding over Deletion Channels
by: Kargı, E. Uras, et al.
Published: (2024)

Redundancy-Optimal Constructions of $(1,1)$-Criss-Cross Deletion Correcting Codes with Efficient Encoding/Decoding Algorithms
by: Liu, Wenhao, et al.
Published: (2026)

Insertion and Deletion Correction in Polymer-based Data Storage
by: Banerjee, Anisha, et al.
Published: (2022)

Reconstruction Codes for Deletions and Insertions: Connection, Distinction, and Construction
by: Sun, Yubo, et al.
Published: (2025)