Some sufficient conditions for (A B)^ with an error-correcting pair (A,B)
From MaRDI portal
Publication:6852088
Cites work
- A characterization of MDS codes that have an error correcting pair
- Almost MDS codes
- An improvement for error-correcting pairs of some special MDS codes
- An Upper Bound of Singleton Type for Componentwise Products of Linear Codes
- Critical Pairs for the Product Singleton Bound
- Fundamentals of Error-Correcting Codes
- Infinite Families of Near MDS Codes Holding t-Designs
- MDS or NMDS self-dual codes from twisted generalized Reed-Solomon codes
- Near MDS codes from oval polynomials
- On m-MDS codes over finite fields
- On decoding by error location and dependent sets of error positions
- On products and powers of linear codes under componentwise multiplication
- On the error-correcting pair for MDS linear codes with even minimum distance
- On the existence of error-correcting pairs
- Secret sharing using near-MDS codes
- The \((+)\)-extended twisted generalized Reed-Solomon code
- The non-gap sequence of a subcode of a generalized Reed-Solomon code
This page was built for publication: Some sufficient conditions for \((\mathcal{A}\ast \mathcal{B})^\perp\) with an error-correcting pair \((\mathcal{A},\mathcal{B})\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6852088)