# US 2016/0259595 A1 · Encoder and decoder design for near-balanced codes

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2016/0259595 A1
- Document ID: US20160259595A1
- Status: Published application
- Kind: A1
- Application number: 15/061,650
- Filed: 2016-03-04
- Published: 2016-09-08
- Earliest claimed: 2015-03-04
- Assignees: SK hynix Inc.
- Applicants: SK hynix memory solutions inc.
- Inventors: Frederick K. H. LEE; Marcus MARROW
- Web page: https://patentgrep.com/patent/US20160259595A1

## CPC

- H03M 7/14: Conversion to or from non-weighted codes
- H03M 13/1102: {Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes}
- H03M 13/1515: {Reed-Solomon codes}
- H03M 13/152: {Bose-Chaudhuri-Hocquenghem [BCH] codes}
- H03M 13/23: using convolutional codes, e.g. unit memory codes
- H03M 13/2957: {Turbo codes and decoding}
- H03M 13/2963: {Turbo-block codes, i.e. turbo codes based on block codes, e.g. turbo decoding of product codes}
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)

## Abstract

Methods of encoding a near-symbol balanced (NSB) sequence may include selecting, with a controller, a constraint based on an amount of bits, determining, with the controller, a plurality of sections in a codebook based on permutations defined by the selected constraint, and partitioning, with the controller, a section among the plurality of sections into a plurality of partitions until each of the plurality of partitions include a number of entries equal to or less than a predetermined number of entries.

## Claims

### Claim 1

A method of encoding a near-symbol balanced (NSB) sequence, comprising:
selecting with a controller a constraint based on an amount of bits;
determining, with the controller, a plurality of sections in a codebook based on permutations defined by the selected constraint; and
partitioning, with the controller, a section among the plurality of sections into a plurality of partitions until each of the plurality of partitions include a number of entries equal to or less than a predetermined number of entries.

### Claim 2 (depends on 1)

The method of claim 1, wherein the partitioning step is performed until each of the partitions include 256 entries or less.

### Claim 3 (depends on 1)

The method of claim 1, further comprising setting a plurality of thresholds that define to which section among the plurality of sections a number maps.

### Claim 4 (depends on 1)

The method of claim 1, wherein the section among the plurality of sections is partitioned based on a Chu-Vandermonde identity.

### Claim 5 (depends on 1)

The method of claim 1, wherein the controller is implemented on a PCRAM device.

### Claim 6 (depends on 1)

The method of claim 1, wherein the constraint includes a lower constraint based on a minimum number of times an alphabet appears in a sequence.

### Claim 7 (depends on 1)

The method of claim 1, wherein the constraint includes an upper constraint based on a maximum number of times an alphabet appears in a sequence.

### Claim 8

A system for encoding a near-symbol balanced (NSB) sequence, including:
a controller suitable for:
selecting a constraint based on an amount of bits;
determining a plurality of sections in a codebook based on permutations defined by the selected constraint; and
partitioning a section among the plurality of sections into a plurality of partitions until each of the plurality of partitions includes a number of entries equal to or less than a predetermined number of entries.

### Claim 9 (depends on 8)

The system of claim 8, wherein the predetermined number of entries is 256 entries.

### Claim 10 (depends on 8)

The system of claim 8, wherein the controller is further suitable for setting a plurality of thresholds that define to which section among the plurality of sections a number maps.

### Claim 11 (depends on 8)

The system of claim 8, wherein the section among the plurality of sections is partitioned based on a Chu-Vandermonde identity.

### Claim 12 (depends on 8)

The system of claim 8, wherein the controller is implemented on a PCRAM device.

### Claim 13 (depends on 8)

The system of claim 8, wherein the constraint includes a lower constraint based on a minimum number of times an alphabet appears in a sequence.

### Claim 14 (depends on 8)

The system of claim 8, wherein the constraint includes an upper constraint based on a maximum number of times an alphabet appears in a sequence.
