HALOWERKDatenvertragswerk
minimum binary covering code family
Given wordlength n1..4 and radius0..n, synthesize ALL minimum-cardinality subsets C of the entire binary cube0..2^n-1 such that every word is within Hamming distance radius of some center in C. Codes may be nonlinear and need not contain0; no generator/parity-check matrix is supplied. Numeric word bit i is coordinate i; distance is popcount(x xor y). Each code is an ascending center list, whole family numeric-lex sorted. Return minimumsize,count,allcenters and aligned per-code witnesses:.
POST https://datenvertrag.halowerk.com/v1/minimum-binary-covering-code-familyEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| n | integer, null | Ja | |
| radius | integer, null | Ja | |
| claimed_codes | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"additionalProperties": false,
"required": [
"n",
"radius",
"claimed_codes"
],
"properties": {
"n": {
"type": [
"integer",
"null"
],
"minimum": 1,
"maximum": 4
},
"radius": {
"type": [
"integer",
"null"
],
"minimum": 0,
"maximum": 4
},
"claimed_codes": {
"anyOf": [
{
"type": "array",
"maxItems": 256,
"items": {
"type": "array",
"maxItems": 16,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 15
}
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"n": 4,
"radius": 1,
"claimed_codes": [
[
0,
1,
14,
15
],
[
0,
2,
13,
15
],
[
0,
3,
13,
14
],
[
0,
4,
11,
15
],
[
0,
5,
11,
14
],
[
0,
6,
11,
13
],
[
0,
7,
8,
15
],
[
0,
7,
9,
14
],
[
0,
7,
10,
13
],
[
0,
7,
11,
12
],
[
1,
2,
12,
15
],
[
1,
3,
12,
14
],
[
1,
4,
10,
15
],
[
1,
5,
10,
14
],
[
1,
6,
8,
15
],
[
1,
6,
9,
14
],
[
1,
6,
10,
13
],
[
1,
6,
11,
12
],
[
1,
7,
10,
12
],
[
2,
3,
12,
13
],
[
2,
4,
9,
15
],
[
2,
5,
8,
15
],
[
2,
5,
9,
14
],
[
2,
5,
10,
13
],
[
2,
5,
11,
12
],
[
2,
6,
9,
13
],
[
2,
7,
9,
12
],
[
3,
4,
8,
15
],
[
3,
4,
9,
14
],
[
3,
4,
10,
13
],
[
3,
4,
11,
12
],
[
3,
5,
8,
14
],
[
3,
6,
8,
13
],
[
3,
7,
8,
12
],
[
4,
5,
10,
11
],
[
4,
6,
9,
11
],
[
4,
7,
9,
10
],
[
5,
6,
8,
11
],
[
5,
7,
8,
10
],
[
6,
7,
8,
9
]
]
}Ergebnis & Dokumentation
Maschinenlesbare Dokumentation dieses Hubs
Quelle dieser Seite: der veröffentlichte HALOWERK-Katalog. Stand: 2026-11-07, 02:42 UTC.
Weitere Endpunkte dieses Hubs
- Datenvertragswerk0,003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n1..5 and a monic degree-n integer polynomial det(xI-A), return EVERY labelled simple undirected graph on vertices0..n-1 having exactly that adjacency characteristic polynomial over integers. Coefficients are descending degree order,
- Datenvertragswerk0,003 USDC
adjacent swap permutation tour
POSThttps://datenvertrag.halowerk.com/v1/adjacent-swap-permutation-tourFor 0 to 5 labels starting at zero, construct the whole Steinhaus-Johnson-Trotter permutation tour from identity. Each transition swaps the largest mobile value with its adjacent smaller neighbor, then reverses directions of greater values.
- Datenvertragswerk0,003 USDC
aligned record cut audit
POSThttps://datenvertrag.halowerk.com/v1/aligned-record-cut-auditA stream-runtime fixture maintainer checks which record IDs belong to a supplied aligned checkpoint cut and which same-channel post-barrier records must stay buffered until all input barriers arrive. One aligned local checkpoint;record iden