Various implementations described herein may refer to and may be directed to error detection circuitry for use with memory. In one implementation, an integrated circuit may include a memory array having a plurality of rows of memory cells, where a respective row is configured to store a data word and one or more check bits corresponding to the data word. The integrated circuit may also include inline error detection circuitry coupled to the respective row and configured to generate one or more flag bit values based on a detection of one or more bit errors in the data word stored in the respective row. The integrated circuit may further include error correction circuitry configured to correct the one or more bit errors in the data word stored in the respective row in response to the one or more generated flag bit values.

According to one embodiment, a search device includes a first comparison module, a determination module, a correction module, a second comparison module, and a search module. The first comparison module compares a received first key with a second key read from a nonvolatile memory. The determination module determines whether error correction is possible based on a first comparison result obtained by the first comparison module. The correction module generates a third key by applying an error correction process to the second key if the determination module determines that error correction is possible. The second comparison module compares the first key with the third key. The search module reads data associated with the second key in the nonvolatile memory if a second comparison result obtained by the second comparison module shows a match.

Example apparatus and methods distribute ranges or erasure codes associated with ranges to reduce or minimize the impact of a single point of failure in an object store. Erasure codes associated with related ranges to be stored in an object store may be accessed and selectively distributed to different storage devices associated with the object store. The erasure codes may be distributed according to a distribution plan so that an unavailability of one storage device will cause less than all of the related ranges to become unavailable. Example apparatus and methods may also provide a partial GET operation that will retrieve erasure codes associated with less than an entire object or with less than all possible ranges for an object. The partial GET operation may facilitate reconstructing less than an entire object, which may be valuable in, for example, weblog analytics.

Redundancy information can be included in nucleotide symbol strings encoding underlying data. To avoid propagation of errors during the decoding process, during encoding, a constrained encoding can be performed before the redundancy information is computed. The redundancy information can be an outer encoding across multiple nucleotide symbol strings. An inner coding within nucleotide symbol strings can also be supported. Such redundancy information can be interleaved into the underlying nucleotide symbol strings to which the constrained encoding has been applied, resulting in a relaxed constraint. Insertion/deletion redundancy information can also be included in the resulting strings, and an insertion/deletion-sensitive sequence can be included to assist in recovering accurate sequences during decoding operations.

Example apparatus and methods distribute ranges or erasure codes associated with ranges to reduce or minimize the impact of a single point of failure in an object store. Erasure codes associated with related ranges to be stored in an object store may be accessed and selectively distributed to different storage devices associated with the object store. The erasure codes may be distributed according to a distribution plan so that an unavailability of one storage device will cause less than all of the related ranges to become unavailable. Example apparatus and methods may also provide a partial GET operation that will retrieve erasure codes associated with less than an entire object or with less than all possible ranges for an object. The partial GET operation may facilitate reconstructing less than an entire object, which may be valuable in, for example, weblog analytics.

An abstraction for storage class memory is provided that hides the details of the implementation of storage class memory from a program, and provides a standard channel programming interface for performing certain actions, such as controlling movement of data between main storage and storage class memory or managing storage class memory.

An apparatus includes control circuits that are configured to connect to a plurality of nonvolatile memory cells. The control circuits are configured to determine that a first portion of user data from the plurality of memory cells that was found to be uncorrectable by ECC is unrecoverable by a first Exclusive OR (XOR) operation using first XOR data and a second portion of user data. The control circuits are further configured to, in response to the determination, recover the first portion of user data by a second XOR operation using second XOR data and a third portion of user data.

Disclosed herein are a method and an apparatus for storing blockchain data based on error correction code. The method for storing blockchain data based on error correction code includes dividing block data to be stored into multiple subblock datasets, generating parity datasets corresponding to the block data, and storing the subblock datasets and the parity datasets in proportion to storage capacities of the blockchain data storage nodes.

A method for cyclic code encoding includes: generating, based on a first symbol sequence related to a first part of symbols in the K payload symbols, a first parity sequence corresponding to the first symbol sequence; generating, based on a second symbol sequence related to a second part of symbols in the K payload symbols, a second parity sequence corresponding to the second symbol sequence, where the first part of symbols are different from the second part of symbols; and generating the (NK) parity symbols based on the first parity sequence and the second parity sequence.

Apparatuses, systems, and methods for indicating data corruption are described. An example method can include receiving a write command to write user data to one or more memory units of a number of memory units. The method can further include generating a number of first bits that are invalid as error correction information or error detection information for the user data responsive to the user data being determined to be corrupted. The method can further include writing the user data to a first portion of the number of memory units and writing, along with the user data and instead of a number of second bits corresponding to the error correction information or the error detection information, the number of first bits to a second portion of the number of memory units.