Pith. sign in

REVIEW 1 cited by

An ontology-based approach to the optimization of non-binary (2,v)-regular LDPC codes

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1409.2019 v1 pith:OID56KBU submitted 2014-09-06 cs.IT math.IT

classification cs.ITmath.IT
keywords codesoptimizationapproachbit-distanceldpcnon-binaryontology-basedregular
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

A non-binary (2,v)-regular LDPC code is defined by a parity-check matrix with column weight 2 and row weight v. In this report, we give an ontology-based approach to the optimization for this class of codes. All possible inter-connected cycle patterns that lead to low symbol-weight codewords are identified to put together the ontology. The optimization goal is to improve the distance property of equivalent binary images. Using the proposed method, the estimation and optimization of bit-distance spectrum becomes easily handleable. Three codes in the CCSDS recommendation are analyzed and several codes with good minimum bit-distance are designed.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Deepfakes on Demand: the rise of accessible non-consensual deepfake image generators

    cs.CY 2025-05 conditional novelty 6.0 of 10

    Public model repositories host tens of thousands of easily downloadable deepfake generators, downloaded millions of times and mostly targeting women.

Pith tools