scientific article; zbMATH DE number 3172225
From MaRDI portal
Publication:3290965
Cited in
(20)- A bound for random and closed loop burst error detecting codes
- An upper bound for codes detecting low-density closed-loop bursts
- A bound for codes correcting random and low-density closed-loop burst errors
- Low-density periodical burst correcting codes with decoding probability and detection capability
- CT bursts-from classical to array coding
- Integer codes capable of correcting burst asymmetric errors
- Burst error statistics of simulated Viterbi decoded BFSK and high-rate punctured codes on fading and scintillating channels
- AN UPPER BOUND ON THE NUMBER OF PARITY CHECKS FOR BURST ERROR DETECTION AND CORRECTION IN EUCLIDEAN CODES
- scientific article; zbMATH DE number 4112536 (Why is no real title available?)
- A fast algorithm to determine the burst-correcting limit of cyclic or shortened cyclic codes
- Lower bounds on achievable rates for limited bitshift correcting codes
- Periodical burst error correcting codes with decoding error probability
- On the Efficiency of Shortened Cyclic Single-Burst-Correcting Codes
- Multiple-burst-error correction by threshold decoding
- Random error and burst correction by iterated codes
- scientific article; zbMATH DE number 3412523 (Why is no real title available?)
- Correction of CT burst array errors in the generalized-Lee-RT spaces
- Lower bounds for codes correcting moderate-density bursts of fixed length with Lee weight consideration
- Bursts in \(m\)-metric array codes
- Campopiano-type bounds in non-Hamming array coding
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3290965)
