HALOWERKDatenvertragswerk
tunstall optimal phrase dictionary family
For supplied positive binary symbol weights[weight0,weight1] each1..4 and exact leafcount2..7, construct ALL full binary prefix phrase dictionaries maximizing expected consumed source symbols per phrase. Model independent identically distributed source symbols with p0=w0/(w0+w1),p1=w1/(w0+w1); no empirical distribution inference. Return exact reduced rational optimum, all optimal dictionaries lexicographically ordered by their sorted phrase arrays, every phrase probability in sameorder and.
POST https://datenvertrag.halowerk.com/v1/tunstall-optimal-phrase-dictionary-familyEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| weights | Siehe Schema | Ja | |
| leaves | Siehe Schema | Ja | |
| claim | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"$schema": "http://json-schema.org/draft-07/schema#",
"type": "object",
"additionalProperties": false,
"required": [
"weights",
"leaves",
"claim"
],
"properties": {
"weights": {
"anyOf": [
{
"type": "array",
"maxItems": 2,
"items": {
"type": "integer",
"minimum": 1,
"maximum": 4
},
"minItems": 2
},
{
"type": "null"
}
]
},
"leaves": {
"anyOf": [
{
"type": "integer",
"minimum": 2,
"maximum": 7
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "array",
"maxItems": 132,
"items": {
"type": "array",
"maxItems": 7,
"items": {
"type": "string",
"minLength": 1,
"maxLength": 6,
"pattern": "^[01]+$"
}
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"weights": [
1,
1
],
"leaves": 3,
"claim": [
[
"0",
"10",
"11"
],
[
"00",
"01",
"1"
]
]
}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